Next Article in Journal
Quantum Game Theory-Based Cloud Resource Allocation: A Novel Approach
Previous Article in Journal
More Theory About Infinite Numbers and Important Applications
Previous Article in Special Issue
Redundant Trees in Bipartite Graphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs

Department of Mathematics, Sungkyunkwan University, Suwon 16419, Republic of Korea
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(9), 1391; https://doi.org/10.3390/math13091391
Submission received: 15 March 2025 / Revised: 19 April 2025 / Accepted: 22 April 2025 / Published: 24 April 2025
(This article belongs to the Special Issue Graph Theory and Applications, 2nd Edition)

Abstract

:
Recently, the exponential arithmetic–geometric index ( E A G ) was introduced. The exponential arithmetic–geometric index ( E A G ) of a graph G is defined as E A G ( G ) = v i v j E ( G ) e d i + d j 2 d i d j , where d i represents the degree of the vertex v i in G. The characterization of extreme structures in relation to graph invariants from the class of unicyclic graphs is an important problem in discrete mathematics. Cruz et al., 2022 proposed a unified method for finding extremal unicyclic graphs for exponential degree-based graph invariants. However, in the case of E A G , this method is insufficient for generating the maximal unicyclic graph. Consequently, the same article presented an open problem for the investigation of the maximal unicyclic graph with respect to this invariant. This article completely characterizes the maximal unicyclic graph in relation to E A G .

1. Introduction

In recent years, graph theory has become a crucial tool in the field of chemistry, particularly in the study of molecular structures. A topological index is a numerical quantity associated with a molecular graph that describes specific physicochemical properties. Since Wiener introduced the first such index [1], many other indices have been developed depending on various graph parameters, including degree, distance, and eccentricity [2,3,4,5,6,7]. Among these, degree-based indices have received significant attention since the 1970s due to their strong correlation with molecular properties. One important example is the arithmetic–geometric index, introduced in [8]. Let G be a simple connected graph, whose vertex set V ( G ) = { v 1 , v 2 , , v n } , with the edge set being denoted as E ( G ) . The degree of the j-th vertex v j is denoted by d j . The arithmetic–geometric index ( A G ) is defined as
A G ( G ) = v i v J E ( G ) d i + d j 2 d i d j .
Numerous publications have extensively studied the mathematical properties of A G , specifically the extremal problems and bounds. Shegehalli et al. [9,10] computed A G for different classes of graphs. Milovanović et al. [11] established some upper bounds on A G for simple connected graphs. Hertz et al. [12] identified extremal chemical graphs for A G . Maximal chemical trees with respect to A G were characterized in [13]. Additional research on A G can be found in [14,15,16,17]. To improve the discriminative power of topological indices, exponential versions were introduced in 2019 [18]. In [19,20], researchers provided a characterization of the extremal trees for the exponential Randić index. Das et al. [21] explored extremal graphs for the exponential atom–bond connectivity index. Jahanbani et al. [22] determined the minimum value of the exponential forgotten index for trees. Das and Mondal [23] examined sharp bounds on the exponential geometric–arithmetic index of bipartite graphs. Further studies on this concept include [24,25,26,27,28,29]. In this paper, we focus on the exponential arithmetic–geometric index ( E A G ), which is defined as
E A G ( G ) = v i v J E ( G ) e d i + d j 2 d i d j .
Previous studies have systematically characterized extremal unicyclic graphs for various degree-based indices. For example, Moon and Park [30] investigated extremal unicyclic graphs for the geometric–arithmetic index, while Cruz et al. [31] addressed the same problem with respect to A G . Liu et al. [32] presented a complete classification of extremal unicyclic graphs for the Lanzhou index. The maximal unicyclic graphs for the exponential second Zagreb and augmented Zagreb indices were described in [33,34]. For more insights into extremal unicyclic graphs, readers can refer to [35,36,37,38,39,40,41,42]. Cruz et al. [37] introduced a unified method for the identification of extremal unicyclic graphs for exponential degree-based indices, which was successfully applied to many well-known indices. However, they discovered that this method is insufficient for generating the maximal unicyclic graph in the case of E A G . Because of this, the following open problem was posed in [37]:
Problem 1
([37]). Characterize the maximal unicyclic graph with respect to E A G in terms of graph order.
This paper aims to fully solve this problem by applying advanced combinatorial methods. Our goal is to develop new methods that will help us to identify the maximal unicyclic graph with respect to E A G .

2. Main Result

In this section, we address and resolve the open problem concerning the exponential arithmetic–geometric index of unicyclic graphs. To achieve this, we first establish the following essential results:
Lemma 1.
Let x 2 . Then, 3 x 5 49 x 4 + 310 x 3 936 x 2 + 1366 x 775 > 0 .
Proof. 
Let f ( x ) = 3 x 5 49 x 4 + 310 x 3 936 x 2 + 1366 x 775 . Now,
3 x 5 49 x 4 + 310 x 3 936 x 2 + 1366 x 775 = x 4 ( 3 x 49 ) + x 2 ( 310 x 936 ) + 1366 x 775 > 0
for x 17 . Using Mathematica [43], we can visualize the function with a plot, which clearly shows that f ( x ) > 0 for all x in the interval [ 2 , 17 ] . □
Lemma 2.
Let
f ( x ) = x 2 x 1 x 1 2 3 ( x 4 ) , x 2 .
Then, f ( x ) is a strictly increasing function on x 2 .
Proof. 
Since
f ( x ) = x 2 x 1 x 1 2 3 ( x 4 ) ,
we have
f ( x ) = 1 4 x 1 x 2 x 1 1 4 3 x 4 x 7 x 4 .
We have to prove that f ( x ) > 0 , i.e.,
1 x 1 x 2 x 1 > 1 3 x 4 x 7 x 4 ,
that is,
3 ( x 2 ) 2 ( x 4 ) 3 > ( x 7 ) ( x 1 ) 3 ,
that is,
3 x 5 49 x 4 + 310 x 3 936 x 2 + 1366 x 775 > 0 ,
which is true by Lemma 1 ( x 2 ) . This proves the result. □
Lemma 3.
Let
g ( x ) = x 2 x 1 x + 3 2 2 ( x + 1 ) , x 4 .
Then, g ( x ) is a strictly increasing function on x 4 .
Proof. 
Since x 4 , one can easily see that
g ( x ) = 1 4 x 1 x 2 x 1 1 4 2 ( x + 1 ) x 1 x + 1 > 0 .
Therefore, g ( x ) is a strictly increasing function on x 4 . □
Lemma 4.
Let
q ( x ) = x + 3 2 2 ( x + 1 ) x + 5 4 x + 1 , x > 0 .
Then, q ( x ) is a strictly increasing function on x > 0 .
Proof. 
Since x > 0 , one can easily see that
q ( x ) = 1 4 2 ( x 1 ) ( x + 1 ) 3 / 2 1 8 ( x 3 ) ( x + 1 ) 3 / 2 > 0 .
Therefore, q ( x ) is a strictly increasing function on x > 0 . □
Lemma 5.
For b d j d i a ,
d i + d j d i d j a + b a b
with equality if and only if d i = a , d j = b .
Proof. 
For b d j d i a , we obtain
d i d j a b , d j d i b a , and hence d i d j 1 / 4 d j d i 1 / 4 a b 1 / 4 b a 1 / 4 .
Using the above result, we obtain
d i d j 1 / 4 + d j d i 1 / 4 2 = d i d j 1 / 4 d j d i 1 / 4 2 + 4 a b 1 / 4 b a 1 / 4 2 + 4 ,
that is , d i d j + d j d i a b + b a , that is , d i + d j d i d j a + b a b .
Moreover, the equality holds if and only if d i = a , d j = b . □
Let S n , 3 be a unicyclic graph of order n obtained by adding an edge to the star graph S n ( S n is a star graph of order n).
Theorem 1.
Let G be a unicyclic graph of order n. Then,
E A G ( G ) ( n 3 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 1 ) + e
with equality if and only if G S n , 3 .
Proof. 
Let be the maximum degree in the unicyclic graph G. If = n 1 , then G S n , 3 with
E A G ( G ) = ( n 3 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 1 ) + e ,
and hence the equality holds. For n 9 , in accordance to Sage [44], one can easily check that the result (1) holds with equality if and only if G S n , 3 . Otherwise, n 2 and n 10 . For any pendant edge v i v j E ( G ) ( 1 = d j d i n 2 < n 1 ) , by Lemma 5, we obtain
d i + d j 2 d i d j < n 2 n 1 .
For any non-pendant edge v i v j E ( G ) ( 2 d j d i n 2 < n 1 ) , by Lemma 5, we obtain
d i + d j 2 d i d j < n + 1 2 2 ( n 1 ) .
For any edge v i v j E ( G ) , from (2) and (3), we obtain
d i + d j 2 d i d j < n 2 n 1
as
n + 1 2 2 ( n 1 ) < n 2 n 1 .
Let k be the length of the cycle in the unicyclic graph G. Then, k 3 . We consider the following two cases:
Case 1.
k = 3 . Let v 1 , v 2 , v 3 be the three vertices on the cycle in G. We assume that d 1 d 2 d 3 2 . We consider the following cases:
Case 1.1.
d 2 = 2 . In this case, d 2 = d 3 = 2 ; hence,
d 2 + d 3 2 d 2 d 3 = 1 .
Let E 1 = { v 1 v 2 , v 2 v 3 , v 3 v 1 } . Using the above result with (3) and (4), we obtain
E A G ( G ) = v i v j E ( G ) e d i + d j 2 d i d j = e d 1 + d 2 2 d 1 d 2 + e d 2 + d 3 2 d 2 d 3 + e d 3 + d 1 2 d 3 d 1 + v i v j E ( G ) E 1 e d i + d j 2 d i d j < 2 e n + 1 2 2 ( n 1 ) + e + ( n 3 ) e n 2 n 1 .
Inequality (1) holds strictly.
Case 1.2.
d 2 = 3 . If d 3 = 3 , then similarly, by Case 1.1, we obtain
E A G ( G ) = e d 1 + d 2 2 d 1 d 2 + e d 2 + d 3 2 d 2 d 3 + e d 3 + d 1 2 d 3 d 1 + v i v j E ( G ) E 1 e d i + d j 2 d i d j < 2 e n + 1 2 2 ( n 1 ) + e + ( n 3 ) e n 2 n 1 .
The result (1) strictly holds. Otherwise, d 3 = 2 . Let v 4 be the vertex adjacent to the vertex v 2 other than v 1 and v 3 . Since d 2 = 3 and d 3 = 2 , we have
d 2 + d 3 2 d 2 d 3 = 25 24 .
Again, since d 2 = 3 and d 4 n 4 , by Lemma 5, we obtain
d 2 + d 4 2 d 2 d 4 n 1 2 3 ( n 4 ) .
Since n 10 , by Lemma 2, we obtain
f ( n ) = n 2 n 1 n 1 2 3 ( n 4 ) f ( 10 ) = 5 3 9 8 > 0.606 .
From the above results, we obtain
e n 2 n 1 + e > e n 1 2 3 ( n 4 ) + 0.606 + e > 1.83 e n 1 2 3 ( n 4 ) + e > e n 1 2 3 ( n 4 ) + 0.83 e n + 2 2 3 + e e n 1 2 3 ( n 4 ) + 1.83 e > e n 1 2 3 ( n 4 ) + e 25 24 e d 2 + d 3 2 d 2 d 3 + e d 2 + d 4 2 d 2 d 4 .
Let E 2 = E 1 { v 2 v 4 } . By (3) and (4), we obtain
e d 1 + d 2 2 d 1 d 2 < e n + 1 2 2 ( n 1 ) , e d 3 + d 1 2 d 3 d 1 < e n + 1 2 2 ( n 1 ) , and e d i + d j 2 d i d j < e n 2 n 1 for any v i v j E ( G ) E 2 .
Using the above results with | E ( G ) E 2 | = n 4 , we obtain
E A G ( G ) = e d 1 + d 2 2 d 1 d 2 + e d 2 + d 3 2 d 2 d 3 + e d 3 + d 1 2 d 3 d 1 + e d 2 + d 4 2 d 2 d 4 + v i v j E ( G ) E 2 e d i + d j 2 d i d j < 2 e n + 1 2 2 ( n 1 ) + e + ( n 3 ) e n 2 n 1 .
The result (1) strictly holds.
Case 1.3.
d 2 4 . Let S 1 = { v 2 v j E ( G ) | for all v j N G ( v 2 ) } , S = S 1 { v 1 v 3 } and E 3 = E ( G ) S . Since G is a unicyclic graph of order n, we have d 1 + d 2 n + 1 . Thus, we have d 1 n 3 , 4 d 2 n + 1 2 , and d 3 2 . Since d 1 d 2 d 3 , by Lemma 5, we obtain
d 1 + d 2 2 d 1 d 2 n + 1 4 n 3 , d 2 + d 3 2 d 2 d 3 n + 5 4 n + 1 , d 1 + d 3 2 d 1 d 3 n 1 2 2 ( n 3 ) < n + 1 2 2 ( n 1 ) .
Since | E 3 | = | E ( G ) S | = n d 2 1 , by (4), we obtain
v i v j E 3 e d i + d j 2 d i d j < ( n d 2 1 ) e n 2 n 1 .
Claim 1.
2 e n + 3 2 2 ( n + 1 ) + e n + 1 4 n 3 + e n + 5 4 n + 1 < 2 e n 2 n 1 + e n + 1 2 2 ( n 1 ) .
Proof of Claim 1.
For 10 n 11 , in accordance to Mathematica [43], one can easily check that the result holds. Otherwise, n 12 . By Lemma 3, the function g ( x ) = x 2 x 1 x + 3 2 2 ( x + 1 ) is increasing on x 12 ; hence,
g ( x ) g ( 12 ) = 6 11 15 2 26 > 0.338 .
Since n 12 , from the above, we have
n 2 n 1 n + 3 2 2 ( n + 1 ) > 0.338 > ln 1.4 ,
that is , e n 2 n 1 n + 3 2 2 ( n + 1 ) > 1.4 , that is , e n 2 n 1 > 1.4 e n + 3 2 2 ( n + 1 ) .
By Lemma 4, the function q ( x ) = x + 3 2 2 ( x + 1 ) x + 5 4 x + 1 is increasing on x 12 ; hence,
q ( x ) q ( 12 ) = 15 2 26 17 4 13 > 0.29 .
Since n 12 , from the above, we have
n + 3 2 2 ( n + 1 ) n + 5 4 n + 1 > 0.29 > ln 5 4 ,
that is , e n + 3 2 2 ( n + 1 ) n + 5 4 n + 1 > 5 4 , that is , 0.8 e n + 3 2 2 ( n + 1 ) > e n + 5 4 n + 1 .
Since n > 5 , one can easily see that
n + 1 4 n 3 < n + 1 2 2 ( n 1 ) , that is , e n + 1 4 n 3 < e n + 1 2 2 ( n 1 ) .
Using the above result with (7) and (8), we obtain
2 e n 2 n 1 + e n + 1 2 2 ( n 1 ) > 2.8 e n + 3 2 2 ( n + 1 ) + e n + 1 2 2 ( n 1 ) > 2 e n + 3 2 2 ( n + 1 ) + e n + 5 4 n + 1 + e n + 1 2 2 ( n 1 ) > 2 e n + 3 2 2 ( n + 1 ) + e n + 5 4 n + 1 + e n + 1 4 n 3 .
This completes the proof of Claim 1. □
For v j N G ( v 2 ) { v 1 , v 3 } , we have 4 d 2 n + 1 2 , 1 d j n 3 2 , and by Lemma 5, we obtain
d 2 + d j 2 d 2 d j n + 3 2 2 ( n + 1 ) .
Using the above result with (5), we obtain
v j : v j N G ( v 2 ) e d 2 + d j 2 d 2 d j = e d 1 + d 2 2 d 1 d 2 + e d 2 + d 3 2 d 2 d 3 + v j : v j N G ( v 2 ) { v 1 , v 3 } e d 2 + d j 2 d 2 d j e n + 1 4 n 3 + e n + 5 4 n + 1 + ( d 2 2 ) e n + 3 2 2 ( n + 1 ) e n + 1 4 n 3 + e n + 5 4 n + 1 + 2 e n + 3 2 2 ( n + 1 ) + ( d 2 4 ) e n 2 n 1
as
n + 3 2 2 ( n + 1 ) < n 2 n 1 .
Using (5), (6), (9) and Claim 1, we obtain
E A G ( G ) = v i v j E ( G ) e d i + d j 2 d i d j = e d 1 + d 3 2 d 1 d 3 + v j : v j N G ( v 2 ) e d 2 + d j 2 d 2 d j + v i v j E 3 e d i + d j 2 d i d j < e n + 1 2 2 ( n 1 ) + e n + 1 4 n 3 + e n + 5 4 n + 1 + 2 e n + 3 2 2 ( n + 1 ) + ( d 2 4 ) e n 2 n 1 + ( n d 2 1 ) e n 2 n 1 < ( n 3 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 2 ) < ( n 3 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 1 ) + e .
The result (1) strictly holds.
Case 2.
k 4 . Let v 1 , v 2 , , v k be the vertices on the cycle C k ( k 4 ) . We can assume that d 1 = max { d i : v i V ( C k ) } . Then, d 1 n k + 2 n 2 and d i 2 ( 2 i k ) . Then, by Lemma 5, for v 1 v 2 E ( C k ) and v 1 v k E ( C k ) , we obtain
d 1 + d 2 2 d 1 d 2 n 2 2 ( n 2 ) and d 1 + d k 2 d 1 d k n 2 2 ( n 2 ) .
Since v 2 v 3 E ( C k ) and v 3 v 4 E ( C k ) with 2 d 2 , d 3 , d 4 n k + 4 2 n 2 , by Lemma 5, we obtain
d 2 + d 3 2 d 2 d 3 n + 4 4 n and d 3 + d 4 2 d 3 d 4 n + 4 4 n .
Claim 2.
2 e n + 4 4 n < e n 2 n 1 + e .
Proof of Claim 2.
For 10 n 12 , in accordance to Mathematica [43], one can easily check that the result holds. Otherwise, n 13 . Let us consider a function
h ( x ) = x x 1 x + 4 2 x , x 13 .
Then, we have
h ( x ) = 1 4 x 3 / 2 ( x 1 ) 3 / 2 2 x 3 / 2 ( x 2 ) ( x 4 ) ( x 1 ) 3 / 2 > 0 .
Thus, h ( x ) is an increasing function on x 13 and, hence,
h ( x ) h ( 13 ) = 13 12 17 2 13 > 1.395 > 2 ln 2 .
From the above, we obtain
n n 1 n + 4 2 n > 2 ln 2 ,
that is,
e n 2 n 1 n + 4 4 n > 2 ,
that is,
2 e n + 4 4 n < e n 2 n 1 < e n 2 n 1 + e .
This completes the proof of Claim 2. □
Let p be the number of pendant vertices in G. Since G has a cycle length of at least 4, we have p n 4 . Since n + 1 2 ( n 1 ) < n n 1 , using (3), we obtain
v i v j E ( G ) { v 2 v 3 , v 3 v 4 } , d i d j 2 e d i + d j 2 d i d j < ( n p 2 ) e n + 1 2 2 ( n 1 ) 2 e n + 1 2 2 ( n 1 ) + ( n p 4 ) e n 2 n 1 .
Using the above result with (2), (10) and Claim 2, we obtain
E A G ( G ) = v i v j E ( G ) , d i d j = 1 e d i + d j 2 d i d j + v i v j E ( G ) , d i d j 2 e d i + d j 2 d i d j < p e n 2 n 1 + e d 2 + d 3 2 d 2 d 3 + e d 3 + d 4 2 d 3 d 4 + v i v j E ( G ) { v 2 v 3 , v 3 v 4 } , d i d j 2 e d i + d j 2 d i d j < p e n 2 n 1 + 2 e n + 4 4 n + ( n p 4 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 1 ) < ( n 3 ) e n 2 n 1 + 2 e n + 1 2 2 ( n 1 ) + e .
The result (1) strictly holds. This completes the proof of the theorem. □

3. Concluding Remarks

The exponential arithmetic–geometric index (denoted as E A G ) is a recently introduced topological index in the field of mathematical chemistry. This index was first brought into the literature by Rada [18]. In [37], the authors proposed an open problem: to characterize the unicyclic graph that attains the maximum E A G value among all unicyclic graphs of a given order n. In this paper, we address and resolve this open problem by providing a complete characterization of an extremal graph. Our findings show that, among all unicyclic graphs with n vertices, the graph S n , 3 uniquely maximizes the E A G index. This result not only settles the open problem posed by Cruz, Rada, and Sánchez but also contributes to a deeper understanding of the behavior of the E A G index in relation to graph structures.

Author Contributions

Conceptualization, K.C.D. and J.B.; investigation, K.C.D. and J.B.; writing—original draft preparation, K.C.D. and J.B.; writing—review and editing, K.C.D. and J.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data presented in this study are openly available in https://figshare.com/articles/dataset/GRAZPEDWRI-DX/14825193 (accessed on 21 April 2025).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef]
  2. Ali, A.; Furtula, B.; Gutman, I.; Vukičević, D. Augmented Zagreb index: Extremal results and bounds. MATCH Commun. Math. Comput. Chem. 2021, 85, 211–244. [Google Scholar]
  3. Aarthi, K.; Elumalai, S.; Balachandran, S.; Mondal, S. Extremal values of the atom-bond sum-connectivity index in bicyclic graphs. J. Appl. Math. Comput. 2023, 69, 4269–4285. [Google Scholar] [CrossRef]
  4. Liu, H. Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices. Comput. Appl. Math. 2023, 42, 89. [Google Scholar] [CrossRef]
  5. Liu, H. Extremal problems on Sombor indices of unicyclic graphs with a given diameter. Comput. Appl. Math. 2022, 41, 138. [Google Scholar] [CrossRef]
  6. Liu, H.; Huang, Y. Sharp bounds on the symmetric division deg index of graphs and line graphs. Comp. Appl. Math. 2023, 42, 285. [Google Scholar] [CrossRef]
  7. Maitreyi, V.; Elumalai, S.; Balachandran, S.; Liu, H. The minimum Sombor index of trees with given number of pendant vertices. Comp. Appl. Math. 2023, 42, 331. [Google Scholar] [CrossRef]
  8. Shegehalli, V.S.; Kanabur, R. Arithmetic-geometric indices of path graph. J. Comput. Math. Sci. 2015, 6, 19–24. [Google Scholar]
  9. Shegehalli, V.S.; Kanabur, R. Arithmetic-geometric indices of some class of graph. J. Comput. Math. Sci. 2015, 6, 194–199. [Google Scholar]
  10. Shegehalli, V.S.; Kanabur, R. Computation of new degree-based topological indices of graphene. J. Math. 2016, 2016, 4341919. [Google Scholar] [CrossRef]
  11. Milovanović, I.x.; Matejixcx, M.M.; Milovanovixcx, E.I. Upper bounds for arithmetic-geometric index of graphs. Sci. Publ. State Univ. Novi Pazar Ser. A Appl. Math. Inform. Mech. 2018, 10, 49–54. [Google Scholar] [CrossRef]
  12. Hertz, A.; Bonte, S.; Devillez, G.; Dusollier, V.; Mélot, H.; Schindl, D. Extremal chemical graphs for the arithmetic-geometric index. MATCH Commun. Math. Comput. Chem. 2025, 93, 791–818. [Google Scholar] [CrossRef]
  13. Vujošević, S.; Popivoda, G.; Vukixcxevixcx, x.K.; Furtula, B.; Škrekovski, R. Arithmetic-geometric index and its relations with geometric-arithmetic index. Appl. Math. Comput. 2021, 391, 125706. [Google Scholar] [CrossRef]
  14. Guo, X.; Gao, Y. Arithmetic-geometric spectral radius and energy of graphs. MATCH Commun. Math. Comput. Chem. 2020, 83, 651–660. [Google Scholar]
  15. Li, G.; Zhang, M. Sharp bounds on the arithmetic-geometric index of graphs and line graphs. Discrete Appl. Math. 2022, 318, 47–60. [Google Scholar] [CrossRef]
  16. Rodríguez, J.M.; Sánchez, J.L.; Sigarreta, J.M.; Tours, E. Bounds on the arithmetic-geometric index. Symmetry 2021, 13, 689. [Google Scholar] [CrossRef]
  17. Zheng, L.; Tian, G.X.; Cui, S.Y. On spectral radius and energy of arithmetic-geometric matrix of graphs. MATCH Commun. Math. Comput. Chem. 2020, 83, 635–650. [Google Scholar]
  18. Rada, J. Exponential vertex-degree-based topological indices and discrimination. MATCH Commun. Math. Comput. Chem. 2019, 82, 29–41. [Google Scholar]
  19. Cruz, R.; Monsalve, J.; Rada, J. Trees with maximum exponential Randić index. Discrete Appl. Math. 2020, 283, 634–643. [Google Scholar] [CrossRef]
  20. Cruz, R.; Rada, J. The path and the star as extremal values of vertex-degree-based topological indices among trees. MATCH Commun. Math. Comput. Chem. 2019, 82, 715–732. [Google Scholar]
  21. Das, K.C.; Elumalai, S.; Balachandran, S. Open problems on the exponential vertex-degree-based topological indices of graphs. Discrete Appl. Math. 2021, 293, 38–49. [Google Scholar] [CrossRef]
  22. Jahanbani, A.; Cancan, M.; Motamedi, R. Extremal Trees for the Exponential of Forgotten Topological Index. J. Math. 2022, 2022, 7455701. [Google Scholar] [CrossRef]
  23. Das, K.C.; Mondal, S. On exponential geometric-arithmetic index of graphs. J. Math. Chem. 2024, 60, 205–217. [Google Scholar] [CrossRef]
  24. Balachandran, S.; Vetrík, T. Exponential second Zagreb index of chemical trees. Trans. Combin. 2021, 10, 97–106. [Google Scholar]
  25. Bera, J.; Das, K.C. The minimal molecular tree for the exponential Randić index. Mathematics 2024, 12, 3601. [Google Scholar] [CrossRef]
  26. Carballosa, W.; Quintana, Y.; Rodríguez, J.M.; Sigarreta, J.M. Exponential topological indices: Optimal inequalities and applications. J. Math. Chem. 2023, 61, 933–949. [Google Scholar] [CrossRef]
  27. Cruz, R.; Monsalve, J.; Rada, J. The balanced double star has maximum exponential second Zagreb index. J. Combin. Optim. 2021, 41, 544–552. [Google Scholar] [CrossRef]
  28. Cruz, R.; Rada, J. Extremal graphs for exponential VDB indices. Kragujev. J. Math. 2022, 46, 105–113. [Google Scholar] [CrossRef]
  29. Das, K.C.; Mondal, S.; Huh, D.Y. On the exponential augmented Zagreb index of graphs. J. Appl. Math. Comput. 2024, 70, 839–865. [Google Scholar] [CrossRef]
  30. Moon, S.; Park, S. Bounds for the geometric-arithmetic index of unicyclic graphs. J. Appl. Math. Comput. 2023, 69, 2955–2971. [Google Scholar] [CrossRef]
  31. Vukićevixcx, X.K.; Vujoševixcx, S.; Popivoda, G. Unicyclic graphs with extremal values of arithmetic-geometric index. Discrete Appl. Math. 2021, 302, 67–75. [Google Scholar] [CrossRef]
  32. Liu, Q.; Li, Q.; Zhang, H. Unicyclic graphs with extremal Lanzhou index. Appl. Math.—J. Chin. Univ. 2022, 37, 350–365. [Google Scholar] [CrossRef]
  33. Das, K.C.; Mondal, S.; Huh, D. Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs. Comput. Appl. Math. 2024, 43, 317. [Google Scholar] [CrossRef]
  34. Eliasi, M. Unicyclic and bicyclic graphs with maximum exponential second Zagreb index. Discrete Appl. Math. 2022, 307, 172–179. [Google Scholar] [CrossRef]
  35. Ali, A.; Alanazi, A.M.; Hassan, T.S.; Shang, Y. On unicyclic graphs with a given number of pendent vertices or matching number and their graphical edge-weight-function indices. Mathematics 2024, 12, 3658. [Google Scholar] [CrossRef]
  36. Chen, M.; Zhu, Y. Extremal unicyclic graphs of Sombor index. Appl. Math. Comput. 2024, 463, 128374. [Google Scholar] [CrossRef]
  37. Cruz, R.; Rada, J.; Sanchez, W. Extremal unicyclic graphs with respect to vertex-degree-based topological indices. MATCH Commun. Math. Comput. Chem. 2022, 88, 481–503. [Google Scholar] [CrossRef]
  38. Das, K.C. On the exponential atom-bond connectivity index of graphs. Mathematics 2025, 13, 269. [Google Scholar] [CrossRef]
  39. Deng, H.; Vetrík, T.; Balachandran, S. On the harmonic index and diameter of unicyclic graphs. Math. Rep. 2020, 22, 11–18. [Google Scholar]
  40. Ergotić, S.M. On unicyclic graphs with minimum Graovac-Ghorbani index. Mathematics 2024, 12, 384. [Google Scholar] [CrossRef]
  41. Ning, W.; Wang, K. On the Estrada indices of unicyclic graphs with fixed diameters. Mathematics 2021, 9, 2395. [Google Scholar] [CrossRef]
  42. Nithyaa, P.; Elumalai, S.; Balachandran, S.; Masrec, M. Ordering unicyclic graphs with a fixed girth by Sombor indices. MATCH Commun. Math. Comput. Chem. 2024, 92, 205–224. [Google Scholar] [CrossRef]
  43. Wolfram Research, Inc. Mathematica, Version 7.0; Wolfram Research, Inc.: Champaign, IL, USA, 2008. [Google Scholar]
  44. Stein, W.A. Sage Mathematics Software, Version 6.8. The Sage Development Team. 2015. Available online: http://www.sagemath.org (accessed on 21 April 2025).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Das, K.C.; Bera, J. Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs. Mathematics 2025, 13, 1391. https://doi.org/10.3390/math13091391

AMA Style

Das KC, Bera J. Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs. Mathematics. 2025; 13(9):1391. https://doi.org/10.3390/math13091391

Chicago/Turabian Style

Das, Kinkar Chandra, and Jayanta Bera. 2025. "Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs" Mathematics 13, no. 9: 1391. https://doi.org/10.3390/math13091391

APA Style

Das, K. C., & Bera, J. (2025). Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs. Mathematics, 13(9), 1391. https://doi.org/10.3390/math13091391

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop