Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17369
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGutman, Ivan-
dc.contributor.authorFurtula, Boris-
dc.contributor.authorIvanović, Miloš-
dc.date.accessioned2023-03-17T13:54:18Z-
dc.date.available2023-03-17T13:54:18Z-
dc.date.issued2012-
dc.identifier.issn0340-6253en_US
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17369-
dc.description.abstractIf G = (V, E) is a molecular graph, and d(u) is the degree of its vertex u, then the atom-bond connectivity index of G is \(ABC = \sum_{uv\in E} \sqrt{[d(u) + d(v) − 2]/[d(u) d(v)]}\). This molecular structure descriptor, introduced by Estrada et al. in the late 1990s, found recently interesting applications in the study of the thermodynamic stability of acyclic saturated hydrocarbons, and the strain energy of their cyclic congeners. In connection with this, one needs to know which trees have extremal ABC-values. Whereas it is easy to demonstrate that the star has maximal ABC, characterizing the trees with minimal ABC appears to be a much more difficult task. In this paper we determine a few structural features of the trees with minimal ABC, which brings us a step closer to the complete solution of the problem.en_US
dc.language.isoen_USen_US
dc.relation.ispartofMATCH Communications in Mathematical and in Computer Chemistryen_US
dc.subjectatom-bond connectivity indexen_US
dc.subjectminimum ABCen_US
dc.subjecttreesen_US
dc.titleNotes on trees with minimal atom-bond connectivity indexen_US
dc.typearticleen_US
dc.description.versionPublisheden_US
dc.type.versionPublishedVersionen_US
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

80

Downloads(s)

100

Files in This Item:
File Description SizeFormat 
paper0081.pdf222.49 kBAdobe PDFThumbnail
View/Open


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