Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/10501
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFurtula, Boris-
dc.contributor.authorGutman I.-
dc.contributor.authorIvanović, Miloš-
dc.contributor.authorVukicević D.-
dc.date.accessioned2021-04-20T15:55:30Z-
dc.date.available2021-04-20T15:55:30Z-
dc.date.issued2012-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/10501-
dc.description.abstractThe ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments and computer-based modeling we establish the basic structural features of the minimum-ABC trees. © 2012 Elsevier Inc. All rights reserved.-
dc.rightsrestrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleComputer search for trees with minimal ABC index-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2012.06.075-
dc.identifier.scopus2-s2.0-84865003454-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

155

Downloads(s)

4

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


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