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...

詳細記述

保存先:
書誌詳細
主要な著者: Haoer, Raad Sehen, Mohd Atan, Kamel Ariffin, Khalaf, Abdul Jalil Manshad, Md. Said, Mohamad Rushdan, Hasni @ Abdullah, Roslan
フォーマット: Conference or Workshop Item
言語:English
出版事項: AIP Publishing 2016
オンライン・アクセス:http://psasir.upm.edu.my/id/eprint/55582/1/Eccentric%20connectivity%20index%20of%20chemical%20trees.pdf
http://psasir.upm.edu.my/id/eprint/55582/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料