Inverse problem for Zagreb indices
Date
2018-10-23
Authors
Lokesha, Veerebradiah
Gutman, Ivan
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
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.
Description
Keywords
Chemistry, Mathematics, Zagreb index, First Zagreb index, Second Zagreb index, Forgotten index, Hyper-Zagreb index, Primary 05C09, Secondary 05C90, Topological indexes
Citation
Yurttaş, A. vd. (2019). ''Inverse problem for Zagreb indices.'' Journal of Mathematical Chemistry, 57(2), 609-615.