The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices
Abstract
For a graph G, the first multiplicative Zagreb index Π1(G) is the product of squares of vertex degrees, and the second multiplicative Zagreb index Π2(G) is the product of products of degrees of pairs of adjacent vertices. In this paper, we explore graphs with extremal 1(G) and 2(G) in terms of (edge) connectivity and pendant vertices. The corresponding extremal graphs are characterized with given connectivity at most k and p pendant vertices. In addition, the maximum and minimum values of Π1(G) and Π2(G) are provided. Our results extend and enrich some known conclusions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.