Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/12262
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | restrictedAccess | - |
dc.contributor.author | Goubko M. | - |
dc.contributor.author | Gutman, Ivan | - |
dc.date.accessioned | 2021-04-20T20:24:35Z | - |
dc.date.available | 2021-04-20T20:24:35Z | - |
dc.date.issued | 2014 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/12262 | - |
dc.description.abstract | A 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.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.source | Applied Mathematics and Computation | - |
dc.title | Degree-based topological indices: Optimal trees with given number of pendents | - |
dc.type | article | - |
dc.identifier.doi | 10.1016/j.amc.2014.04.081 | - |
dc.identifier.scopus | 2-s2.0-84901465098 | - |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.