Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges (Q1634681)

Summary: Given a (molecular) graph, the first multiplicative Zagreb index \(\Pi_1\) is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index \(\Pi_2\) is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs \(\mathbb G_{n, k}\) having \(n\) vertices and \(k\) cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in \(\mathbb{G}_{n, k}\) are provided. We also provide these graphs with the largest and smallest \(\Pi_1(G)\) and \(\Pi_2(G)\) in \(\mathbb G_{n, k}\).