Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/12262
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorGoubko M.-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T20:24:35Z-
dc.date.available2021-04-20T20:24:35Z-
dc.date.issued2014-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/12262-
dc.description.abstractA dynamic programming method is elaborated, enabling the characterization of trees with a given number of pendent vertices, for which a vertex-degree-based invariant (topological index) achieves its extremal value. The method is applied to the chemically interesting and earlier much studied such invariants: the first and second Zagreb index, and the atom-bond connectivity index. © 2014 Elsevier Inc. All rights reserved.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleDegree-based topological indices: Optimal trees with given number of pendents-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2014.04.081-
dc.identifier.scopus2-s2.0-84901465098-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

435

Downloads(s)

8

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.