Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9477
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGutman I.-
dc.contributor.authorFurtula, Boris-
dc.contributor.authorAhmadi M.-
dc.contributor.authorHosseini S.-
dc.contributor.authorSalehi Nowbandegani P.-
dc.contributor.authorZarrinderakht M.-
dc.date.accessioned2020-09-19T18:22:58Z-
dc.date.available2020-09-19T18:22:58Z-
dc.date.issued2013-07-24-
dc.identifier.issn03545180-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/9477-
dc.description.abstractThe atom-bond connectivity (ABC) index of a graph G is defined as the sum over all pairs of adjacent vertices u; ν, of the terms √[d(u) + d(ν) - 2]=[d(u) d(ν)], where d(ν) denotes the degree of the vertex ν of the graph G. Whereas the finding of the graphs with the greatest ABC-value is an easy task, the characterization of the graphs with smallest ABC-value, in spite of numerous attempts, is still an open problem. What only is known is that the connected graph with minimal ABC index must be a tree, and some structural features of such trees have been determined. Several conjectures on the structure of the minimal-ABC trees, were disproved by counterexamples. In this review we present the state of art of the search for minimal-ABC trees, and provide a complete bibliography on ABC index.-
dc.relation.ispartofFilomat-
dc.titleThe ABC index conundrum-
dc.typeArticle-
dc.identifier.doi10.2298/FIL1306075G-
dc.identifier.scopus84880347249-
Appears in Collections:Faculty of Science, Kragujevac

[ Google Scholar ]

Page views(s)

18

Downloads(s)

3

Files in This Item:
File Description SizeFormat 
10.2298-FIL1306075G.pdf176.44 kBAdobe PDFThumbnail
View/Open


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