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.
7 December 2023 in RAIRO - Theoretical Informatics and Applications
Sombor index is a popular vertex-degree-based topological index recently. In this paper, the maximum values of Sombor index for the class of all bicyclic graphs with a given matching number are wholly determined, then the extremal graphs with these maximum values are also characterized.
Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_G(u)^2+d_G(v)^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In this paper, we obtain the sharp lower and upper bounds on $SO(G)$ of a connected graph, and characterize graphs for which these bounds are attained.
22 March 2026 in Notes on Number Theory and Discrete Mathematics
The multiplicative sum Zagreb index, regarded as the multiplicative version of the first Zagreb index, is defined as the product of the degree sum over all pairs of adjacent vertices. In this paper, we determine the extremal values of the multiplicative sum Zagreb index for three class of trees. Some bounds on the multiplicative sum Zagreb index are obtained, and the corresponding extremal graphs with these bounds are characterized.
29 June 2026 in Malaysian Journal of Mathematical Sciences
For a graph Ω with vertex set V (Ω) and edge set E(Ω), its harmonic index is defined as $H(\Omega) = \sum_{uv \in E(\Omega)} \frac{2}{d_u + d_v}$, where $d_u and d_v$ denote the degrees of vertices $u$ and $v$, respectively.The harmonic index captures various structural characteristics of a graph, such as connectivity and the uniformity of its vertex degree distribution, and finds application in many fields, including molecular structure analysis, network layout optimization, and information dissemination analysis. In this paper, we first determine the extremal values of the harmonic index for chemical graphs, and chemical trees. Moreover, using some relevant operations, we fully characterize the trees with branch vertices that achieve the extremal values of the harmonic index.