Eccentric connectivity index of chemical trees
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively; we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as t...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
AIP Publishing
2016
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/55582/1/Eccentric%20connectivity%20index%20of%20chemical%20trees.pdf http://psasir.upm.edu.my/id/eprint/55582/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|