1. Introduction
Chemical compounds (like hydrocarbons) can be represented by means of graphs. A topological descriptor is a numerical value (or a set of numerical values) that encapsulates some property of that graph. Moreover, if the descriptor correlates with a certain molecular characteristic, it is said to be a topological index, and it can be employed to study physicochemical properties of chemical substances.
In mathematical chemistry the analytical and structural properties of topological indices have been studied in depth over the last years (see, e.g., [
1,
2,
3]). The theoretical and practical interest of topological indices lies in the fact that they have become an important tool for the study of multiple practical problems in Computer Science ([
4]), Physic ([
5]), Ecology ([
6]), among others.
Countless applications of topological indices have been reported, most of them concerned with exploring medicinal and pharmacological issues. A turning point in the mathematical examination of topological indices happened in the second half of the 1990s, when a significant and ever growing research field on this matter started, resulting in numerous publications. In this context, especially the papers of Erdös [
7,
8] should be mentioned.
The concept of variable molecular descriptors was proposed as a new way of characterizing heteroatoms in molecules (see [
9,
10]), but also to assess structural differences (see [
11]). In [
12] the authors tested the correlation abilities of several topological indices used in practice for the case of standard heats of formation and normal boiling points of octane isomers.
In the sequel
denotes a finite simple graph where,
is the set of vertices and
is the set of edges.
denotes the degree of the vertex
i. In [
13,
14,
15], the following variable Zabreb indices are studied:
with
.
is known as the variable first Zabreb index and
is the variable second Zabreb index.
Note that if we take
, we obtain the well-known first Zagreb index
; if
, we obtain the inverse degree index
is the forgotten index, etc. Moreover, if
, we obtain
the famous Randić index and
is the second Zagreb index. It is noteworthy that
with
(the modified Zagreb index ([
16])) performs significantly better than
.
Besides, variable Zagreb indices have shown their theoretical importance and applicability in mathematical chemistry (see [
17]). The idea behind the variable molecular descriptors is that the variables are determined during the regression so that the standard error of estimate for a particular studied property is as small as possible. For application details and mathematical theory see [
14,
15,
18,
19,
20,
21,
22].
In [
23] is studied the variable sum-connectivity index
with
.
Note that
, thus
is the first Zagreb index
,
is the harmonic index
H (see [
24,
25,
26,
27,
28]), etc. Some relations connecting these indices are reported in [
26].
In [
29,
30] the variable geometric-arithmetic index is defined by
with
.
Clearly, and are the geometric-arithmetic index , and the arithmetic-geometric index , respectively.
In [
30,
31] is introduced the variable inverse sum indeg index as
with
.
Note that is the standard inverse sum indeg index .
Motivation and Contributions
The main reason for use topological indices is to obtain prediction of some property of molecules (see, e.g., [
11,
12]). Therefore, given some fixed parameters, a natural problem is to find the graphs that minimize (or maximize) the value of a topological index on the set of graphs satisfying the restrictions given by the parameters (see, e.g., [
7,
8]).
Let
be any symmetric function (
),
any function and
. Many important topological indices can be defined as
or
One of the main problems in the study of topological indices is to find bounds for them, since this kind of results provide interrelations between different topological indices:
Since topological indices correlate with chemical properties of compounds, finding the compound with extreme behavior for a certain property is equivalent to optimizing a topological index with a strong correlation with that property on the appropriate set of graphs . If the behavior of the graphs with respect to the index is determined, and there exists a known relation between and , then a large amount of the graphs in can be removed a priori before starting the study. This leads to a significant simplification in the optimization problem.
The main goal of this paper is to obtain optimal bounds for the general topological indices and . We have seen that many important topological indices can be obtained from and by choosing appropriate values of and functions f and h:
if , then is the first Zagreb index ;
if , then is the inverse degree index ;
if , then is the forgotten index F;
if , then is the variable first Zagreb index ;
if , then is the second Zagreb index ;
if , then is the usual Randić index ;
if , then is the modified Zagreb index ;
if , then is the variable second Zagreb index ;
if , then is the sum-connectivity index ;
if , then is the harmonic index H;
if , then is the variable sum-connectivity index ;
if , then is the geometric-arithmetic index ;
if , then is the arithmetic-geometric index ;
if , then is the variable geometric-arithmetic index ;
if , then is the variable inverse sum indeg index ;
if , then is the variable inverse sum indeg index .
Thus, each theorem in this paper about and is a result for each one of these indices. Moreover, for each fixed function f (respectively, h), we obtain a result for each real value of .
Our approach provides both new tools for the study of topological indices and new bounds for a large class of topological indices. In particular, we obtain several optimal bounds of (respectively, ) involving (respectively, ), see Theorems 1, 2 and 3 (respectively, Propositions 1, 2 and 3). Moreover, we provide several optimal bounds of in terms of (see Theorems 4 and 5), and two optimal bounds of involving and in Theorem 6.
2. Bounds for the General Topological Indices and
Throughout this work, denotes a finite simple graph. We denote by , , n, m the maximum degree, the minimum degree and the cardinality of the set of vertices (order) and edges (size) of H, respectively.
A graph is regular if all its vertices have the same degree. A graph is bipartite if a set of vertices can be partitioned into two disjointed sets so that all its edges have one end in each of those sets. A graph is said to be biregular if a bipartite graph such that the vertices of one bipartition have degree and the vertices of the other bipartition have degree .
In [
32] it is proved that, if
are positive numbers which
and
F is a real continuous function that is convex, then:
Note that if , we obtain the following particular case of Jensen’s inequality. This inequality will be a main ingredient in the proof of Theorem 1 below.
Lemma 1. Let be a convex function and , then Theorem 1. Consider a symmetric function . If H is a graph of size m and with , thenand the bound is tight if H is a regular or biregular graph. Proof. By the premise of the theorem we have to
with
. Since
, we can consider the convex function
. Lemma 1 gives
If
H is regular or biregular with maximum degree
and minimum degree
, then
□
The previous theorem shows some mathematical relationships for the general variable index . Note that this result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a symmetric function of two real variables .
The argument in the proof of Theorem 1 allows to prove the following result.
Proposition 1. Consider a function . If H is a graph of order n vertices and with , thenand the bound is tight if H is a regular graph. The previous proposition shows some mathematical relations for the general variable index . This result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a function of a real variable .
Corollary 1. Let H be a graph of order n and size m, and let with . Thenthe equality in each bound is attained if H is a regular or biregular graph. Moreover, the equality in the bound is attained if H is a regular graph. Proof. Let
defined as
it is clear that these are symmetric functions, then applying Theorem 1 with the functions
respectively we have
and the equality in each bound is attained if
H is a regular or biregular graph, let
defined as
then by Proposition 1 we have
and the equality in the bound is attained if
H is a regular graph. □
The previous corollary establishes new relations between some variable topological indices which are common in many theoretical and practical applications.
Theorem 2. Consider a symmetric function . If H is a graph of size m and with and , thenand the bound is tight if H is a regular or biregular graph. Proof. By the premise of the theorem we have to
with
. Since
, we can consider the convex function
. Lemma 1 gives
If
H is regular or biregular with maximum degree
and minimum degree
, then
□
The previous theorem also shows some mathematical relationships for the general variable index . Note that this result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a symmetric function of two real variables.
Proposition 2. Consider a function . If H is a graph of order n and with and , thenand the bound is tight if H is a regular graph. Proof. Since
, we can consider the convex function
. Lemma 1 gives
If
H is regular, then
for all
and
□
The previous proposition shows some mathematical relations for the general variable index . This result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a function of a real variable.
The proof of the following corollary is analogous to the proof of Corollary 1 using the results obtained in Theorem 2 and Proposition 2.
Corollary 2. If H is a graph of order n, size m and with and , thenthe bound is tight if H is a regular or biregular graph, the bound is tight if H is a regular graph. Note that the previous corollary provides optimal bounds for variable topological indices based on two important invariants of a graph (maximum degree and minimum degree).
The following Lemma appears in [
22]. This inequality will be useful in the proofs of Theorem 3 and Proposition 3 below.
Lemma 2. Consider real numbers , and . Then Theorem 3. Consider a symmetric function and . If H is a graph with maximum degree Δ and minimum degree δ, andthen Proof. Let us consider first the case
. Since
for every
, Lemma 2 gives
Consider now the case
and define
and
. Thus,
. If we consider the function
, then
for every
, and the previous argument gives
□
The previous theorem shows some mathematical relationships for the general variable index . Note that this result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a symmetric function of two real variables.
Proposition 3. Consider a function and . If H is a graph with maximum degree Δ and minimum degree δ, andthen Proof. Let us consider first the case
. Since
for every
, Lemma 2 gives
Consider now the case
and define
and
. Thus,
. If we consider the function
, then
for every
, and the previous argument gives
□
The previous proposition also shows some mathematical relations for the general variable index . This result has an important theoretical scope since it allows to find bounds for all possible topological indices that can be written as a function of a real variable.
The proof of the following corollary is quite analogous to the proof of Corollary 1 using the results obtained in Theorem 3 and Proposition 3.
Corollary 3. Consider a symmetric function and . If H is a graph with minimum degree δ
and maximum degree Δ, then The previous results establish new bounds on the variable topological indices. Furthermore, in this same direction, the well known classical indices (harmonic index, Randić index, Zagred index, among others) appear as particular cases and .
3. Relations between and
Theorem 4. If H is a graph with minimum degree δ, maximum degree Δ
and , then The lower bound is tight if and only if H is regular. If , the upper bound is tight if and only if H is regular. If , the upper bound is tight if and only if H is biregular. If , the upper bound is tight if and only if H is regular or biregular. Proof. We are going to study the function
on the set
. Since
so
is a strictly decreasing function on
for each fixed
, and so
.
Since
is a strictly decreasing function on
, we have
and the equality is attained if and only if
. Thus,
and this last bond is tight if and only if
for each
, i.e.,
H is a regular graph.
Since
has at most a zero on
and
, we conclude
If
, then the equality in the bound holds if and only if
, if
, then the equality in the bound holds if and only if
and
, if
, then the equality in the bound holds if and only if
or
and
. Therefore,
If , then the bound is tight if and only if for any , i.e., H is regular. If , then the bound is tight if and only if for any , i.e., H is biregular. If , then the bound is tight if and only if for any , or for every , i.e., H is regular or biregular. □
The previous theorem shows some relations between the variable geometric-arithmetic index and the variable inverse sum indeg index , which are two of the most important and well-studied variable topological indices.
Theorem 5. If H is a graph with minimum degree δ, maximum degree Δ
and , then The upper bound is tight if and only if H is regular. If , the lower bound is tight if and only if H is regular. If , the lower bound is tight if and only if H is biregular. If , the lower bound is tight if and only if H is regular or biregular. Proof. The argument in the proof of Theorem 4 gives that
for every
. Hence,
and so,
for any
, and
□
The previous theorem is useful, since it provides functional properties of the variable topological indices and , and two important invariants of a graph (the maximum degree and the minimum degree ).
The following Lemma is well-known (see, e.g., ([
33], Lemma 5) for a proof of the equality statement). It will be useful in the proof of Theorem 6 below.
Lemma 3. If and for , then If for some , then the equality holds if and only if and for every .
Theorem 6. If H is a graph with minimum degree δ, maximum degree Δ
and , then Moreover, the lower bound is tight if and only if H is regular, while the upper bound is tight if H is a regular or biregular graph.
Proof. Cauchy-Schwarz inequality gives
If
H is a regular or biregular graph, then
Let us prove the lower bound.
Since
for every
, Lemma 3 gives that
Lemma 3 gives that the equality in this bound is attained if and only if , i.e., H is regular. □
The previous theorem is useful, since it establishes functional properties of the variable topological indices , and , and two important invariants of a graph (the maximum degree and the minimum degree ).
4. Comparative Studies and Conclusions
The main goal of the research on topological indices from a theoretical approach is twofold: firstly, to find new relationships among them and, secondly, to obtain optimal bounds (which confirm the validity and relevance of the relations found). Motivated by the studies [
12,
15], the introduction of a new general index
was deemed convenient by the authors. This index opens a way of grouping the variable topological indices and analyzing their properties and relations.
In the aforementioned works, only one chemical-computational study is carried out and several numerical relationships between the different topological indices are shown. Our work responds to the need raised in [
12,
15] in two ways: firstly, by conducting a theoretical-analytical study on the general index
and, secondly, by obtaining new optimal relationships for that index that involve important invariants of a graph such as measure, order, maximum degree, and minimum degree (see Theorems 1, 2 and 3).
It is important to highlight that in the works [
13,
14], the authors study the variable topological index
in tree-type graphs and find optimal bounds for that index in some families of trees. We study the general index
that contains, as a particular case, the variable topological index
; furthermore, we find new relationships for all graphs and we obtain optimal bounds associated to other infinite families of graphs (regular and bi-regular graphs).
In [
26] the authors study the variable topological index
and generalize the results of [
27]. Likewise, they find optimal bounds for
in terms of several invariants of the graph (order, maximum degree and minimum degree). In our research these results are generalized (see Corollaries 1, 2 and 3) and new relationships are found between
and other important topological indices (see Theorem 6). It should be noted that all these relationships are optimal, as evidenced by the results.
In [
29] the authors generalize the well-known geometric-arithmetic index, for
and obtain bounds in terms of invariants of the graph such as: measure, maximum degree and minimum degree. In [
30] a new generalization of the geometric-arithmetic index for every real
is shown, and a statistical-computational study is conducted on that index. In this research, the study carried out in [
30] is complemented with a theoretical-analytical study of
and in the same direction, new optimal bounds that expand the results shown in [
29] are obtained (see Corollaries 1, 2 and 3 and Theorem 6).
In [
30,
31] two studies on the variable inverse sum indeg index
are conducted. In the first, from a statistical-computational viewpoint and in the latter, from a spectral perspective. However, neither one considers a theoretical-analytical approach, and that made us follow this perspective in our work, in which optimal relations and bounds are found for the variable inverse sum indeg index (Corollaries 1, 2 and 3 and Theorems 4, 5 and 6).
Topological indices have been successfully applied in several branches of science (see, e.g., [
4,
5,
6]). In this research, we focus on a new general framework, given by two new general topological indices
and
. They allow to obtain, with each result on
(see Theorems 1, 2 and 3) and
(see Propositions 1, 2 and 3), inequalities for a large family of topological indices. In this general approach, the use of the above mentioned functions (
f and
h) allows us to find new properties of the most important variable topological indices:
if , then is the variable second Zagreb index ;
if , then is the variable sum-connectivity index ;
if , then is the variable geometric-arithmetic index ;
if , then is the variable inverse sum indeg index ;
if , then is the variable first general Zagreb index .
We obtain, in particular, new optimal bounds and relations between these five variable topological indices in Corollaries 1, 2 and 3.
Furthermore, this general approach opens a new line of research in relation to the analytical study of other topological indices and provides a basis for defining new indices with potential application in mathematical chemistry.
Besides, we obtain several optimal bounds of in terms of (see Theorems 4 and 5), and two bounds of involving and in Theorem 6.