Eccentric connectivity index of certain classes of cycloalkenes
Let G be a simple connected molecular graph. The eccentric connectivity index ξ(G) is defined as ξ(G)=∑vϵV(G)deg(v)ec(v), where deg(v) denotes the degree of vertex v and ec(v) is the largest distance between v and any other vertex uϵG. In this paper, we establish the general formulas for the eccentr...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Springer
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/60418/1/Eccentric%20connectivity%20index%20of%20certain%20classes%20of%20cycloalkenes.pdf http://psasir.upm.edu.my/id/eprint/60418/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let G be a simple connected molecular graph. The eccentric connectivity index ξ(G) is defined as ξ(G)=∑vϵV(G)deg(v)ec(v), where deg(v) denotes the degree of vertex v and ec(v) is the largest distance between v and any other vertex uϵG. In this paper, we establish the general formulas for the eccentric connectivity index of molecular graphs of cycloalkenes. |
|---|