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: | , , , , |
|---|---|
| 格式: | Article |
| 语言: | English |
| 出版: |
Academic Publications
2016
|
| 在线阅读: | 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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!