Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/10935
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yurtas A. | - |
dc.contributor.author | Togan M. | - |
dc.contributor.author | v, lokesha | - |
dc.contributor.author | cangul, ismail naci | - |
dc.contributor.author | Gutman, Ivan | - |
dc.date.accessioned | 2021-04-20T17:04:24Z | - |
dc.date.available | 2021-04-20T17:04:24Z | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 0259-9791 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/10935 | - |
dc.description.abstract | © 2018, Springer Nature Switzerland AG. The inverse problem for integer-valued topological indices is about the existence of a graph having its index value equal to a given integer. We solve this problem for the first and second Zagreb indices, and present analogous results also for the forgotten and hyper-Zagreb index. The first Zagreb index of connected graphs can take any even positive integer value, except 4 and 8. The same is true if one restricts to trees or to molecular graphs. The second Zagreb index of connected graphs can take any positive integer value, except 2, 3, 5, 6, 7, 10, 11, 13, 15 and 17. The same is true if one restricts to trees or to molecular graphs. | - |
dc.rights | restrictedAccess | - |
dc.source | Journal of Mathematical Chemistry | - |
dc.title | Inverse problem for Zagreb indices | - |
dc.type | article | - |
dc.identifier.doi | 10.1007/s10910-018-0970-x | - |
dc.identifier.scopus | 2-s2.0-85055690235 | - |
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.