Sharp bounds for Zagreb indices of maximal outerplanar graphs

Sharp bounds for Zagreb indices of maximal outerplanar graphs

0.00 Avg rating0 Votes
Article ID: iaor20116932
Volume: 22
Issue: 2
Start Page Number: 252
End Page Number: 269
Publication Date: Aug 2011
Journal: Journal of Combinatorial Optimization
Authors: , , ,
Keywords: optimization
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.

Reviews

Required fields are marked *. Your email address will not be published.