paper

The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices

arXiv:1711.09014

Abstract

For a graph , the first multiplicative Zagreb index is the product of squares of vertex degrees, and the second multiplicative Zagreb index is the product of products of degrees of pairs of adjacent vertices. In this paper, we explore graphs with extremal and in terms of (edge) connectivity and pendant vertices. The corresponding extremal graphs are characterized with given connectivity at most and pendant vertices. In addition, the maximum and minimum values of and are provided. Our results extend and enrich some known conclusions.

arXiv admin note: substantial text overlap with arXiv:1704.06943