Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc. The graph invariant , known under the name general reduced second Zagreb index, is defined as , where is the degree of the vertex v of the graph and is any real number. In this paper, among all trees of order n, and all unicyclic graphs of order n with girth g, we characterize the extremal graphs with respect to . Using the extremal unicyclic graphs, we obtain a lower bound on of graphs in terms of order n with k cut edges, and completely determine the corresponding extremal graphs. Moreover, we obtain several upper bounds on of different classes of graphs in terms of order n, size m, independence number , chromatic number k, etc. In particular, we present an upper bound on of connected triangle-free graph of order , edges with , and characterize the extremal graphs. Finally, we prove that the Turán graph gives the maximum among all graphs of order n with chromatic number k.
A connected graph G is said to be a cactus if any two cycles have at most one vertex in common. The multiplicative sum Zagreb index of a graph G is the product of the sum of the degrees of adjacent vertices in G. In this paper, we introduce several graph transformations that are useful tools for the study of the extremal properties of the multiplicative sum Zagreb index. Using these transformations and symmetric structural representations of some cactus graphs, we determine the graphs having maximal multiplicative sum Zagreb index for cactus graphs with the prescribed number of pendant vertices (cut edges). Furthermore, the graphs with maximal multiplicative sum Zagreb index are characterized among all cactus graphs of the given order.