On the sharp upper and lower bounds of multiplicative Zagreb indices of graphs with connectivity at most k

arXiv1704.06943MaRDI QIDQ6285847FDOQ6285847

Authors: Shaohui Wang 

Publication date: 23 April 2017

Abstract: For a (molecular) graph, the first multiplicative Zagreb index $pro{d}_1(G)$ is the product of the square of every vertex degree, and the second multiplicative Zagreb index $pro{d}_2(G)$ is the product of the products of degrees of pairs of adjacent vertices. In this paper, we explore graphs in terms of (edge) connectivity. The maximum and minimum values of $pro{d}_1(G)$ and $pro{d}_2(G)$ of graphs with connectivity at most $k$ are provided. In addition, the corresponding extremal graphs are characterized, and our results extend and enrich some known conclusions.

This page was built for publication: On the sharp upper and lower bounds of multiplicative Zagreb indices of graphs with connectivity at most k

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285847)