Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/5942
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHaoer, R.S.-
dc.contributor.authorAtan, K.A.-
dc.contributor.authorKhalaf, A.M.-
dc.contributor.authorMd Said, M.R.-
dc.contributor.authorHasni, R.-
dc.date.accessioned2017-05-21T08:36:02Z-
dc.date.available2017-05-21T08:36:02Z-
dc.date.issued2016-
dc.identifier.citationVol.12;Issue 10;6694-6697 p.en_US
dc.identifier.issn1546 1955-
dc.identifier.urihttp://hdl.handle.net/123456789/5942-
dc.description.abstractLet G = (V,E) be a simple connected molecular graph. The eccentric connectivity index ξ (G) is a distance-based molecular structure descriptor that was recently used for mathematical modelling of biological activities of diverse nature. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V = V (G) and E = E(G), respectively. If d(u, v) be the notation of distance between vertices u, v ∈ V and is defined as the length of a shortest path connecting them. Then, the eccentricity connectivity index of a molecular graph Gis defined as ξ(G) = ∑ v∈V(G) deg(v)ec(v), where deg(v) (or simply dv ) is degree of a vertex v ∈ V (G), and is defined as the number of adjacent vertices with v. ec(v) is defined as the length of a maximal path connecting to another vertex of v. In this paper, we establish the general formulas for the eccentricity connectivity index of molecular graphs classes of chemical trees with applicatioen_US
dc.language.isoenen_US
dc.publisherJournal of Computational and Theoretical Nanoscienceen_US
dc.subjectAlkynesen_US
dc.subjectChemical treesen_US
dc.subjectEccentric connectivity indexen_US
dc.subjectEccentricityen_US
dc.subjectMolecular graphsen_US
dc.titleEccentric Connectivity Index Of Molecular Grapgs Of Chemical Trees With Application To Alkynesen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.