Lokesha, VeerebradiahGutman, Ivan2023-03-232023-03-232018-10-23Yurttaş, A. vd. (2019). ''Inverse problem for Zagreb indices.'' Journal of Mathematical Chemistry, 57(2), 609-615.0259-97911572-8897https://doi.org/10.1007/s10910-018-0970-xhttps://link.springer.com/article/10.1007/s10910-018-0970-xhttp://hdl.handle.net/11452/31711The 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.eninfo:eu-repo/semantics/closedAccessChemistryMathematicsZagreb indexFirst Zagreb indexSecond Zagreb indexForgotten indexHyper-Zagreb indexPrimary 05C09Secondary 05C90Topological indexesArticle0004581393000112-s2.0-85055690235609615572Chemistry, multidisciplinaryMathematics, interdisciplinary applicationsGraph; Unicyclic Graph; Vertex Degree