Eccentric connectivity index of unicyclic graphs with application to cycloalkanes
Let G be a simple connected molecular graph. The eccentric connectivity index ξ(G) is defined as ξ (G) = ∑ν∈V(G)deg (ν)ec(ν), where deg(ν) denotes the degree of vertex v and ec(ν) is the largest distance between ν and any other vertex u of G. In this paper, we construct the general formulas for the...
Saved in:
Main Authors: | Haoer, Raad Sehen, Mohd Atan, Kamel Ariffin, Khalaf, Abdul Jalil Manshad, Hasni @ Abdullah, Roslan |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IEEE
2015
|
Online Access: | http://psasir.upm.edu.my/id/eprint/51901/1/Eccentric%20connectivity%20index%20of%20unicyclic%20graphs%20with%20application%20to%20cycloalkanes.pdf http://psasir.upm.edu.my/id/eprint/51901/ http://ieeexplore.ieee.org/document/7357055/ |
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) -
On the atom bond connectivity index of certain trees and unicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015) -
Eccentric connectivity index of certain classes of cycloalkenes
by: Haoer, Raad Sehen, et al.
Published: (2015) -
Eccentric connectivity index of some chemical trees
by: Haoer, R. S., et al.
Published: (2016) -
The atom bond connectivity index of some trees and bicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)