 On maximum Zagreb connection indices for trees with fixed domination numberZahid Raza and Shehnaz Akhter Chaos, Solitons & Fractals, 2023, vol. 169, issue C Abstract: The Zagreb connection indices of a graph are notable topological descriptors constructed from the connection number of every vertex (cardinality of set of vertices with distance two from that vertex). In 1972, these indices were presented to determine the total electron energy of the alternate hydrocarbons. The Zagreb connection indices give finer values for the correlation coefficient for the 13 physico-chemical characteristics of the octane isomers compared to basic Zagreb indices. For many years, all these connection indices have been ignored by researchers for further work. Recently, determining the extremal bounds for the topological indices in terms of graph parameters has turned out to be an interesting direction in extremal graph theory, and numerous related results have been acquired in the literature. This article presents sharp bounds on the first, second, and modified Zagreb connection indices of trees with a fixed domination number. These bounds are strict, and the trees which attained these bounds are characterized. Keywords: Modified Zagreb connection indices; Sharp bounds; Trees; Domination number (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:169:y:2023:i:c:s0960077923001431 DOI: 10.1016/j.chaos.2023.113242 Access Statistics for this article Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros More articles in Chaos, Solitons & Fractals from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.