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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!