Eccentric connectivity index of some chemical trees
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V(G) and E(G), respectively. If d(u, v) be the notation of distance between vertices u, v ε V(G) and is de...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academic Publications
2016
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/55583/1/Eccentric%20connectivity%20index%20of%20some%20chemical%20trees.pdf http://psasir.upm.edu.my/id/eprint/55583/ http://www.ijpam.eu/contents/2016-106-1/12/12.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V(G) and E(G), respectively. If d(u, v) be the notation of distance between vertices u, v ε V(G) and is defined as the length of a shortest path connecting them. Then, the eccentricity connectivity index of a molecular graph G is defined as ζ(G) = Σ vεv(G) deg(v)ec(v), where deg(v) is degree of a vertex v ε V(G), and is defined as the number of adjacent vertices with v. ec(v) is eccentricity of a vertex v ε V(G), and is defined as the length of a maximal path connecting to another vertex of v. In this paper, we establish the general formulas for the eccentricity connectivity index of some classes of chemical trees. |
|---|