The maximal tree with respect to the exponential of the second Zagreb index††thanks: This work is supported by the National Natural Science Foundation of China (11971164) and the Department of Education of Hunan Province (19A318).
Abstract
The second Zagreb index is . It was found to occur in certain approximate expressions of the total -electron energy of alternant hydrocarbons and used by various researchers in their QSPR and QSAR studies. Recently the exponential of a vertex-degree-based topological index was introduced. It is known that among all trees with vertices, the exponential of the second Zagreb index attains its minimum value in the path . In this paper, we show that attains its maximum value in the balanced double star with vertices and solve an open problem proposed by Cruz and Rada [R. Cruz, J. Rada, The path and the star as extremal values of vertex-degree-based topological indices among trees, MATCH Commun. Math. Comput. Chem. 82 (3) (2019) 715-732].
Keywords: Exponential of the second Zagreb index; Maximal tree
1 Introduction
The first Zagreb index and the second Zagreb index were introduced 50 years ago [10]. The Zagreb indices and their variants have been used to study molecular complexity, chirality, ZE-isomerism and heterosystems whilst the overall Zagreb indices exhibited a potential applicability for deriving multilinear regression models. Zagreb indices are also used by various researchers in their QSPR and QSAR studies. Mathematical properties of the Zagreb indices have also been studied. Readers can refer to the paper [12] and the cited literature. The second Zagreb index was found to occur in certain approximate expressions of the total -electron energy of alternant hydrocarbons [10]. We encourage the reader to consult [1, 4, 5, 6, 7, 8, 11, 15] for the historical background, computational techniques, and mathematical properties of the second Zagreb index.
For simple graph with edge set , the second Zagreb index of is defined as
where is the degree of the vertex in . It is a vertex-degree-based (VDB for short) topological index, also referred as bond incident degree index.
A formal definition of a VDB topological index is as follows. Let be the set of graphs with non-isolated vertices. Consider the set
and for a graph , denote by the number of edges in joining vertices of degree and . A VDB topological index over is a function induced by real numbers defined as
for every .
Many important topological indices are obtained from different choices of . For example, the first Zagreb index induced by numbers ; the second Zagreb index induced by ; the Randić index induced by , et al. For details on VDB topological indices, see [3, 9, 13, 14].
In order to study of the discrimination ability of topological indices, Rada [13] introduced the exponential of a vertex-degree-based topological index. Given a vertex-degree-based topological index , the exponential of , denoted by , is defined as
The extremal value problem of over the set of trees with vertices was initiated in [3], and it was shown that , attain their minimum value in the path , , , , , attain their minimum value in the star , , attain their maximum value in the star , , , attain their maximum value in the path . In [2], it was shown that attains its maximum value in the path . These results are summarized in Table 1.
min | ||||||||
---|---|---|---|---|---|---|---|---|
max |
The maximum value of over is still an open problem. In this paper, we prove that the maximum value of over is attained in the balanced double star , and solve an open problem proposed by Cruz and Rada [3].
2 Trees with maximum exponential second Zagreb index
We first show in this section that in a maximal tree with respect to over , the distance between any pendant vertex and any vertex with the maximum degree in is at least 2

Lemma 1.
If is a maximal tree with respect to in , then the distance between a pendant vertex and a vertex with the maximum degree in is at most 2.
Proof. Otherwise, there is a vertex with the maximum degree in and a path such that is not a pendent vertex in . Let , and be the components of containing , and , respectively, see Figure 1. Let , , , where , . The set of neighbours of in is with (), and the set of neighbours of is with (). Let , then , , and
So, and is not a maximal tree with respect to in .

Remark. Let (), in which all distances between any pendent vertex and any vertex with the maximum degree are at most 2, then has the form shown in Figure 2, where is its unique vertex with the maximum degree if , or is a double star if .

Lemma 2.
Let and be the trees on vertices given in Figure 3, where is a vertex with the maximum degree and is a subtree of . If , then .
Proof. Let be the maximum degree in . The sets of neighbours of and in are and , respectively, where , . Let , then , , and
So, .
In the following, we consider the double star , it is a tree on vertices with exactly two non-pendent vertices of degrees and , respectively.
Lemma 3.
Let be the double star on vertices, where . If is a maximal tree with respect to among all double stars on vertices, then , i.e., is the balanced double star with vertices. And
Proof. Let and be two non-pendent vertices of the double star , and . Without loss of generality, we assume that . If , let , where is a neighbour of in , then and
So, and is not maximal with respect to among all double stars on vertices.
Theorem 4.
If and , , then is not maximal with respect to over .
Proof. In fact, for , the star on vertices is not maximal with respect to over .
If is not a double star, then by Lemma 1, we may assume that all distances between a pendant vertex and a vertex with the maximum degree in are at least 2 and has the form depicted in Figure 2, where . By Lemma 2, is not maximal.
So, is a double star and the result follows from Lemma 3.
References
References
- [1] J. Braun, A. Kerber, M. Meringer, C. Rucker, Similarity of molecular descriptors: the equivalence of Zagreb indices and walk counts, MATCH Commun. Math. Comput. Chem. 54 (2005) 163-176.
- [2] R. Cruz, J. Monsalve, J. Rada, Trees with maximum exponential Randić index, Discrete Applied Mathematics (2020), https://doi.org/10.1016/j.dam.2020.03.009.
- [3] R. Cruz, J. Rada, The path and the star as extremal values of vertex-degree-based topological indices among trees, MATCH Commun. Math. Comput. Chem. 82 (3) (2019) 715-732.
- [4] K. C. Das, I. Gutman, Some properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem. 52 (2004) 103-112.
- [5] H. Deng, A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs, MATCH Commun. Math. Comput. Chem. 57 (2007) 597-616.
- [6] H. Deng, D. Sarala, S. K. Ayyaswamy, et al. The Zagreb indices of four operations on graphs, Applied Math. Comput. 275 (2016) 422-431.
- [7] M. Eliasi, A. Ghalavand, Trees with the minimal second Zagreb index, Kragujevac J. Math. 42 (3) (2018) 325-333.
- [8] C. M. da Fonseca, D. Stevanovic, Further properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem. 72 (2014) 655-668.
- [9] I. Gutman, Degree-based topological indices, Croat. Chem. Acta, 86 (2013) 351-361.
- [10] I. Gutman, N. Trinajstić, Graph theory and molecular orbitals. Total -electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (1972), 535-538.
- [11] F. Javaid, M. K. Jamil, I. Tomescu, Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices, Discrete Applied Math. 270 (2019) 153-158.
- [12] S. Nikolić, G. Kovačević, A. Miličević, N. Trinajstić, The Zagreb indices 30 years after, Croat. Chem. Acta, 76 (2) (2003) 113-124.
- [13] J. Rada, Exponential vertex-degree-based topological indices and discrimination, MATCH Commun. Math. Comput. Chem. 82 (1) (2019) 29-41.
- [14] R. Todeschini, V. Consonni, Molecular Descriptors for Chemoinformatics, Wiley-VCH, Weinheim, 2009.
- [15] A. Yurttas, M. Togan, V. Lokesha, et al. Inverse problem for Zagreb indices, J. Math. Chem. 57 (2) (2019) 609-615.