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: | Haoer, R. S., Mohd Atan, Kamel Ariffin, Khalaf, A. M., Md. Said, Mohamad Rushdan, Hasni, Roslan |
---|---|
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!
|
Similar Items
-
Eccentric connectivity index of chemical trees
by: Haoer, Raad Sehen, et al.
Published: (2016) -
Eccentric connectivity index of certain classes of cycloalkenes
by: Haoer, Raad Sehen, et al.
Published: (2015) -
Eccentric connectivity index of unicyclic graphs with application to cycloalkanes
by: Haoer, Raad Sehen, et al.
Published: (2015) -
The atom bond connectivity index of some trees and bicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015) -
On the atom bond connectivity index of certain trees and unicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)