Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9477
Title: The ABC index conundrum
Authors: Gutman I.
Furtula, Boris
Ahmadi M.
Hosseini S.
Salehi Nowbandegani P.
Zarrinderakht M.
Journal: Filomat
Issue Date: 24-Jul-2013
Abstract: The 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.
URI: https://scidar.kg.ac.rs/handle/123456789/9477
Type: Article
DOI: 10.2298/FIL1306075G
ISSN: 03545180
SCOPUS: 84880347249
Appears in Collections:Faculty of Science, Kragujevac
[ Google Scholar ]

Page views(s)

14

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.