Sharp bounds of the Zagreb indices of k-trees

John Estes () and Bing Wei ()
Additional contact information
John Estes: University of Mississippi
Bing Wei: University of Mississippi

Journal of Combinatorial Optimization, 2014, vol. 27, issue 2, No 5, 291 pages

Abstract: Abstract For a graph G, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of the products of degrees of pairs of adjacent vertices. The Zagreb indices have been the focus of considerable research in computational chemistry dating back to Gutman and Trinajstić in 1972. In 2004, Das and Gutman determined sharp upper and lower bounds for M 1 and M 2 values for trees along with the unique trees that obtain the minimum and maximum M 1 and M 2 values respectively. In this paper, we generalize the results of Das and Gutman to the generalized tree, the k-tree, where the results of Das and Gutman are for k=1. Also by showing that maximal outerplanar graphs are 2-trees, we also extend a result of Hou, Li, Song, and Wei who determined sharp upper and lower bounds for M 1 and M 2 values for maximal outerplanar graphs.

Keywords: Zagreb indices; k-Trees; k-Degenerate graphs; Maximal outerplanar graphs; Trees (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9515-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:2:d:10.1007_s10878-012-9515-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9515-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().