Sharp bounds for Zagreb indices of maximal outerplanar graphs
Ailin Hou (),
Shuchao Li (),
Lanzhen Song and
Bing Wei ()
Additional contact information
Ailin Hou: Central China Normal University
Shuchao Li: Central China Normal University
Lanzhen Song: University of Mississippi University
Bing Wei: University of Mississippi University
Journal of Combinatorial Optimization, 2011, vol. 22, issue 2, No 9, 252-269
Abstract:
Abstract For a (molecular) graph, 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 products of degrees of pairs of adjacent vertices. In this paper, we investigate the first and the second Zagreb indices of maximal outerplanar graph. We determine sharp upper and lower bounds for M 1-, M 2-values among the n-vertex maximal outerplanar graphs. As well we determine sharp upper and lower bounds of Zagreb indices for n-vertex outerplanar graphs (resp. maximal outerplanar graphs) with perfect matchings.
Keywords: Zagreb index; Maximal outerplanar graph; Perfect matching (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9288-8 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:22:y:2011:i:2:d:10.1007_s10878-010-9288-8
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-010-9288-8
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 ().