Extremal problems on exponential vertex-degree-based topological indices

: In this work we obtain new lower and upper optimal bounds for general (exponential) indices of a graph. In the same direction, we show new inequalities involving some well-known topological indices like the generalized atom-bound connectivity index ABC α and the generalized second Zagreb index M α 2 . Moreover, we solve some extremal problems for their corresponding exponential indices ( e ABC α and e M α 2 )


Introduction
A topological descriptor is a single number that represents a chemical structure in graph-theoretical terms via the molecular graph, they play a significant role in mathematical chemistry, especially in the QSPR/QSAR investigations.A topological descriptor is called a topological index if it correlates with a molecular property.Topological indices are used to understand physico-chemical properties of chemical compounds, since they capture the essence of some properties of a molecule in a single number.
Several of the well-known topological indices based its computing as a sum of terms which correspond to edges where each term is obtained by a symmetric expression of the degree of both end points, e.g., harmonic, Randić connectivity, first and second Zagreb, atom-bound connectivity and Platt indices.Lately, researchers in chemistry and pharmacology have focused in topological indices based on degrees of vertices obtaining good results and showing that a number of these indices has turned out to be a useful tool, see [1] and references therein.Probably, Randić connectivity index (R) [2] is the most known.In fact, there exist hundreds of works about this molecular descriptor (see, e.g., [3][4][5][6][7][8] and the references therein).Trying to improve the predictive power of this index during many years, scientists proposed a great number of new topological descriptors based on degrees of vertices, similar to the Randić index.There are a lot of works showing the interest on these indices, see e.g., [9][10][11][12][13][14][15][16][17].
The study of the exponential vertex-degree-based topological indices was initiated in [18] and has been successfully studied in [19][20][21][22][23][24][25].The study of topological indices associated to exponential representations has been successfully studied in [12,14,20,22,26,27].Cruz et al. mentioned in 2020 some open problems on the exponential vertex-degree-based topological indices of trees [28] and Das et al. show in 2021 the solution of two of those problems in [23].In this sense, we work with generic exponential topological indices described below that allows us to improve some of the bounds given in [23] as well as obtain some new results.
Along this work, given a graph As usual, uv denotes an edge of the graph G connecting the vertices u and v, and d x denotes the degree of the vertex x.The family of the topological indices like the one to the right above are called exponential for obvious reasons.Two examples of those topological indices that have been extended to its exponential indices are the generalized atom-bound connectivity index, ABC α , and the generalized second Zagreb index, M α 2 , defined respectively as Then, their corresponding exponential indices are The study of topological indices is often formalized mathematically as optimization problems on graphs.In general, those problems have been proven to be useful and quite difficult.Indeed, to obtain quasi-minimizing or quasi-maximizing graphs is a good strategy that is commonly used.Therefore, frequently, it is needed to find bounds on them which involve several parameters.
Topological indices have been successfully applied to different branches of knowledge, such as chemistry, physics, biology, social sciences, etc. see [29][30][31][32][33].In this direction, two of the most important theoretical and practical problems facing the study of topological indices are the following: the study of the extremal problems associated with topological indices and obtaining new inequalities relating different indices.This research has as fundamental contribution to face the above mentioned problems associated with the study of exponential vertex-degree-based topological indices.In particular, we solve some extremal problems related with the exponential vertex-degree-based topological indices e M α 2 and e ABC α .Also, we obtain new lower and upper optimal bounds for these general exponential indices.

Optimization problems on the exponential index e M α 2
Throughout this work, G = (V(G), E(G)) denotes a (non-oriented) finite simple graph without isolated vertices.Given a graph G and v ∈ V(G), we denote by N(v) the set of neighbors of v, i.e., We denote by ∆, δ, n, m the maximum degree, the minimum degree and the cardinality of the set of vertices and edges of G, respectively; thus, 1 ≤ δ ≤ ∆ < n.
We study in this section some optimization problems on the exponential index e M α 2 .
Recall that we denote by N(w) the set of neighbors of w.
Proposition 2.1.Let G be a graph with nonadjacent vertices u and v.If f is a symmetric function which is increasing in each variable, then e F (G + uv) > e F (G).
Proof.Since f is increasing in each variable, we have e f Hence, e F (G + uv) > e F (G).
For example, if we take α > 0, f (x, y) = (xy) α , the cycle C n with n > 2 and remove one edge we obtain the path P n , and we have e M a 2 (C n ) = ne 4 α , e M a 2 (P n ) = (n − 3)e 4 α + 2e 2 α and e M a 2 (C n ) − e M a 2 (P n ) = 3e 4 α − 2e 2 α > 0. Now if we take the complete graph K n with n > 2 and H is the graph obtained by removing an edge from K n , we have e M a 2 (K n ) = n(n−1) 2 e (n−1) 2α , e M a 2 (H) ] α > 0. Thus, we have e (n−1) α −(n−2) α > 1 > 2n−4 2n−3 .Given an integer n ≥ 2, let G(n) be the set of graphs with n vertices.Given integers 1 ≤ δ < n, let H(n, δ) be the set of graphs with n vertices and minimum degree δ We consider the optimization problem for the exponential index e M α 2 on G(n).
(1) The unique graph that maximizes the e M α 2 index on G(n) is the complete graph K n .(2) If n is even, then the unique graph that minimizes the e M α 2 index on G(n) is the disjoint union of n/2 paths P 2 .If n is odd, then the unique graph that minimizes the e M α 2 index on G(n) is the disjoint union of (n − 3)/2 paths P 2 and a path P 3 .
Proof.Since α > 0 we have that f (x, y) = (xy) α is an increasing function in each variable and so, we can apply Proposition 2.1.The first item is a direct consequence of Proposition 2.1.
Assume first that n is even.Handshaking lemma gives 2m ≥ nδ ≥ n.We have for any graph and the equality in the bound is attained if and only if d u = 1 for every u ∈ V(G), i.e., G is the disjoint union of n/2 path graphs P 2 .Assume now that n is odd, and consider a graph G ∈ G(n).If d u = 1 for every u ∈ V(G), then handshaking lemma gives 2m = n, a contradiction since n is odd.Thus, there exists a vertex w with d w ≥ 2. Handshaking lemma gives 2m ≥ (n − 1)δ + 2 ≥ n + 1.We have and the equality in the bound is attained if and only if d u = 1 for every u ∈ V(G) \ {w}, and d w = 2, i.e., G is the disjoint union of (n − 3)/2 path graphs P 2 and a path graph P 3 .
Note that for α = 1, the result in Theorem 2.2 was obtained in [20,Theorem 2.2].
In [34] appears the following result.
(1) If kn is even, then there is a connected k-regular graph with n vertices.
(2) If kn is odd, then there is a connected (k + 1, k)-pseudo-regular graph with n vertices.
Given integers 1 ≤ δ < n, denote by K δ n the n-vertex graph with maximum degree n−1 and minimum degree δ, obtained from the complete graph K n−1 and an additional vertex v in the following way: Fix . ., u δ v}. Figure 1 illustrates this construction by showing the graphs K 2 6 and K 3 6 .
We consider now the optimization problem for the exponential index e M α 2 on H(n, δ).
(1) Then the unique graph in H(n, δ) that maximizes the e M α 2 index is K δ n .
(2) If δ ≥ 2 and δn is even, then the unique graphs in H(n, δ) that minimize the e M α 2 index are the δ-regular graphs.
Proposition 2.1 gives e M α 2 (K δ n ) > e M α 2 (G).This proves item (1).Handshaking lemma gives 2m ≥ nδ.Since d u ≥ δ for every u ∈ V(G), we obtain and the equality in the bound is attained if and only if d u = δ for every u ∈ V(G).
If δn is even, then Lemma 2.3 gives that there is a δ-regular graph with n vertices.Hence, the unique graphs in H(n, δ) that minimize the e M α 2 index are the δ-regular graphs.If δn is odd, then handshaking lemma gives that there is no regular graph.Hence, there exists a vertex w with d w ≥ δ + 1.Since d u ≥ δ for every u ∈ V(G), handshaking lemma gives 2m ≥ (n − 1)δ + δ + 1 = nδ + 1.We have From the above and since w has at least δ + 1 neighbors we have and equality in the bound is attained if and only if d u = δ for every u ∈ V(G) \ {w}, and d w = δ + 1. Lemma 2.3 gives that there is a (δ + 1, δ)-pseudo-regular graph with n vertices.Therefore, the unique graphs in H(n, δ) that minimize the e M α 2 index are the (δ + 1, δ)-pseudo-regular graphs.

Optimal inequalities for exponential generalized atom-bound connectivity indices
In .
The equality holds if every edge of G is incident to a vertex of degree 2, or G is regular or biregular.
Note that the exponential function exp(x) = e x is a strictly convex function, and Jensen's inequality gives , and the equality in this bound is attained if and only if The following result relates the exponential generalized atom-bound connectivity indices with positive and negative parameters.Theorem 3.2.Let G be a graph with m edges, minimum degree δ, maximum degree ∆ > 2, and without isolated edges, and let α, β ∈ R with α > 0 > β.Then e and the equality holds if and only if G is regular.
and the equality holds if and only if G is the disjoint union of star graphs K If δ > 2, then the equality holds if and only if G is regular.If δ = 2, then the equality holds if and only if each edge in G is incident to a vertex with degree two.
Let us define We have Then g 1 (y) is strictly decreasing, and consequently g 1 (∆) ≤ g 1 (y).Therefore, for each uv ∈ E(G) we have We have If δ = 1, then g 2 (y) > 0 and so, g 2 (y) is strictly increasing.Consequently, g 2 (y) ≤ g 2 (∆), and we have for each and the equality in the last inequality holds if and only if d u = 1 and d v = ∆ o viceversa for each uv ∈ E(G), i.e., G is the disjoint union of star graphs K 1,∆ .If δ = 2, then g 2 (y) = 0 and so, g 2 (y) is a constant function.We have The hypothesis ∆ > 2 in Theorem 3.2 is not an important restriction: If ∆ = 2, then G is is the disjoint union of path and cycle graphs with three or more vertices, and we have e ABC α (G) = me ( 1 2 ) α .Hence, e ABC α (G) = e ( 1 2 ) α −( 1 2 ) β e ABC β (G).

Conclusions
We have studied some properties of the generalized exponential indices.For the exponential index e M α 2 with α > 0, we characterize the graphs with extreme values in the class of graphs with a fixed number of vertices and in the class of graphs with a fixed minimum degree and a fixed number of vertices.
In addition, we found some optimal inequalities involving the exponential atom-bound connectivity index.In particular, we found a bound that improves a result in [23].Also, we obtained an inequality concerning the indices e ABC α for different values of the parameter.
As an open problem it remains to find the extremal graphs and to obtain optimal bounds for other generalized exponential vertex-degree-based topological indices.In particular, for the index e M a 2 to find the extremal graphs in other classes, for example the class of graphs with n vertices and fixed maximum degree.

[ 23 ,√ 2 .Proposition 3 . 1 .
Theorem 2.1] appears the inequality e ABC (G) ≥ ∆ e The equality holds in this bound if and only if G is a disjoint union of isolated edges or each connected component of G is a path graph P k (k ≥ 3) or a cycle graph C k (k ≥ 3).If G is a graph with size m, then e ABC (G) ≥ m e ABC(G) m

2 βe
ABC β (G) ≤ e ABC α (G), and the equality in the last inequality holds if and only ifd u = d v = ∆ for each uv ∈ E(G), i.e., G is a regular graph.Let us define g 2 (y) = g(δ, y)

2 βe 2 βe
ABC β (G), and the equality in the last inequality holds if and only if each edge in G is incident to a vertex with degree two.If δ > 2, then g 2 (y) < 0 and so, g 2 (y) is strictly decreasing.Consequently, g 2 (y) ≤ g 2 (δ), and we have for each uv ∈ E(GABC β (G), and the equality in the last inequality holds if and only if d u = d v = δ for each uv ∈ E(G), i.e., G is a regular graph.