SCIDAR - A Digital Archive of the University of Kragujevac
A digital archive of the University of Kragujevac contains easily searchable and up-to-date research results.
Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/10501Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.rights.license | restrictedAccess | - |
| dc.contributor.author | Furtula, Boris | - |
| dc.contributor.author | Gutman I. | - |
| dc.contributor.author | Ivanović, Miloš | - |
| dc.contributor.author | Vukicević D. | - |
| dc.date.accessioned | 2021-04-20T15:55:30Z | - |
| dc.date.available | 2021-04-20T15:55:30Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.issn | 0096-3003 | - |
| dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/10501 | - |
| dc.description.abstract | The 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.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.source | Applied Mathematics and Computation | - |
| dc.title | Computer search for trees with minimal ABC index | - |
| dc.type | article | - |
| dc.identifier.doi | 10.1016/j.amc.2012.06.075 | - |
| dc.identifier.scopus | 2-s2.0-84865003454 | - |
| Appears in Collections: | Faculty of Science, Kragujevac | |
 | Page views(s)489 | Downloads(s)12 |
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.