Some new upper bounds for the inverse sum indeg index of graphs

Let G  = ( V , E ) be a simple connected graph with the vertex set V = {1,2,..., n } and sequence of vertex degrees ( d 1 , d 2 ,..., d n ) where d i denotes the degree of a vertex i ∈ V . With i ∼ j , we denote the adjacency of the vertices i and j in the graph G . The inverse sum indeg ( ISI ) index of the graph G is defined as ISI ( G )=∑ i ∼ j ( d i d j )/( d i + d j ). Some new upper bounds for the ISI index are obtained in this paper.


Introduction
Let G be a simple connected graph with the vertex set V = {1, 2, . . . , n}, edge set E = {e 1 , e 2 , . . . , e m } and sequence of vertex degrees (d 1 , d 2 , · · · , d n ) satisfying d 1 d 2 · · · d n > 0 where d i is the degree of a vertex i 2 V . If e 2 E is an edge connecting the vertices i and j, then degree of the edge e is defined as d(e) = d i + d j 2. Denote by (d(e 1 ), d(e 2 ), · · · , d(e m )) the sequence of edge degrees satisfying d(e 1 ) d(e 2 ) · · · d(e m ). As usual, we assume that = d 1 d 2 · · · d n = > 0 and e = d(e 1 ) + 2 d(e 2 ) + 2 · · · d(e m ) + 2 = e . If the vertices i and j are adjacent, we write i ⇠ j.
In graph theory, an invariant is a numerical quantity of graphs that depends only on their abstract structure, not on the labeling of vertices or edges, or on the drawing of the graphs. In chemical graph theory, such quantities are also referred to as topological indices. Topological indices gained considerable popularity because of their applications in chemistry as molecular structure descriptors [10,32,33].
A large number of topological indices have been derived depending on vertex degrees. Among the oldest are the first and the second Zagreb index, M 1 and M 2 , defined as [17,18] As shown in [26], the first Zagreb index can be written as Bearing in mind that for the edge e connecting the vertices i and j, holds the index M 1 can also be considered as an edge-degree-based topological index [23,24] The following multiplicative variants of the first and the second Zagreb indices, ⇧ 1 and ⇧ 2 , were introduced in [19] (see also [34]) Soon after the appearance of ⇧ 1 and ⇧ 2 , the multiplicative sum Zagreb index, ⇧ ⇤ 1 , was introduced [11] ⇧ The sum-connectivity index, SCI, is defined as [36] Probably the most popular and most thoroughly investigated molecular-structure descriptor is the classical Randić (or connectivity) index www.ejgta.org Some new upper bounds for the inverse sum indeg index of graphs | Akbar Ali et al.
defined in [29]. The general Randić index, R ↵ , is defined [6] as where ↵ is a non-zero real number. Here we are interested in the case ↵ = 1, that is for R 1 . This was defined in [26] under the name modified second Zagreb index. The harmonic index, H, is defined as [12] H = H(G) = Details about the mathematical properties of all the above mentioned topological indices can be found in the surveys [2,3,7,14,20,21] and related references listed therein. Here, it needs to be mentioned that the Harary index [9] is also denoted by H -but in the remaining part of this paper, by the notation H, we mean the harmonic index. A family of 148 discrete Adriatic indices was introduced and analyzed in [35]. An especially interesting subclass of these 148 topological indices consists of 20 indices, which are useful for predicting the certain physicochemical properties of chemical compounds. The so called inverse sum indeg (ISI) index is one of these 20 indices. It is defined as The ISI index is a significant predictor of total surface area for octane isomers [35]. The problem of finding bounds on the ISI index has gained a considerable attention from researchers in recent years, for example, see [4,5,8,13,15,16,22,27,31]. In this paper, we derive several new upper bounds on the ISI index in terms of some graph parameters and above mentioned vertex-degreebased topological indices.

Preliminaries
In this section, we recall some discrete inequalities for real number sequences that will be used in the subsequent considerations.
Let a = (a k ) and b = (b k ), k = 1, 2, . . . , m, be positive real number sequences. In [28], it was proven that for any r 0, it holds with equality if and only if a 1 b 1 = a 2 b 2 = · · · = am bm .

Main results
In the following theorem, we established an upper bound for the inverse sum indeg index, in terms of graph parameters n, e and e and topological indices M 1 and M 2 . (3)

Equality sign in (3) holds if and only if G is regular or semiregular bipartite graph.
Proof. For p k := where summation is performed over all edges in graph G, the inequality (1) becomes For According to (4) and (5) follows wherefrom we obtain (3). Equality in (1) holds if and only if either a 1 = a 2 = · · · = a m , or a 1 = a 2 = · · · = a s a s+1 = · · · = a m for some s, 1  s  m 1. This means that equality in (4) is attained if and only if either e = d(e 1 ) + 2 = · · · = d(e m ) + 2 = e , or e = d(e 1 ) + 2 = · · · = d(e s ) + 2 The equality sign in the first inequality holds if and only if G is regular or semiregular bipartite graph. Equality in the second inequality holds if and only if e = 2 and e = 2 .
Proof. Using the arithmetic-geometric mean inequality for real numbers (see e.g. [25]), according to (6)  wherefrom we obtain the first inequality in (7). The second inequality in (7) follows from the first inequality and from the following inequality In the next theorem, we derive an upper bound for the ISI index in terms of the graph parameters m, e , e and topological indices R, H and M 2 .
Equality holds if and only if G is regular or semiregular bipartite graph.
Proof. For r = 1, a k := p d i d j , b k := 1 d i +d j , where summation is performed over all edges in G, the inequality (2) becomes Using the arithmetic-harmonic mean inequality for real numbers (see [25]), we have that From (9) and (10), it follows that X Finally, from (11) and (4), the desired inequality follows. Equality in (9) holds if and only if d i d j (d i + d j ) = c, c = const., for every edge of G. Equality in (10) holds if and only if d i d j = c 1 , c 1 = constant, for every edge of G. Let j and v be two vertices adjacent to vertex i, that is i ⇠ j and i ⇠ v. Then, equalities in (9) and (10) hold if and only if d j = d v . Since the graph G is connected, equalities in (9) and (10) hold if and only if G is regular or semiregular bipartite graph. Therefore, equality in (11) holds if and only if G is regular or semiregular bipartite graph. Equalities in both (4) and (11) hold if and only if G is regular or semiregular bipartite graph. Finally, equality in (8) holds if and only if G is regular or semiregular bipartite graph.
By the similar arguments as in case of Corollary 3.1, the following corollary of Theorem 3.2 can be proved. In the following theorem, we establish an upper bound for the ISI index in terms of parameters m, e , e and topological indices M 2 , R 1 and SCI.
Theorem 3.3. If G is a simple connected graph with m 1 edges then Equality holds if and only if G is regular or semiregular bipartite graph.
Proof. For r = 1, a k : where summation is performed over all edges in G, the inequality (2) transforms into By the arithmetic-harmonic mean inequality for real numbers (see e.g. [25]), we have Now, from (13) and (14), it follows that Eventually, the inequality (12) is obtained from (4) and (15). Equality in (13) holds if and only if d i d j (d i + d j ) = c, c = constant, for every edge in the graph G. Equality in (14) holds if and only if d i + d j = c 1 , c 1 = constant, for every edge of G. Therefore, equality in (14) holds if and only if G is regular or semiregular bipartite graph. Consequently, it can be easily observed that equality in (12) holds if and only if G is regular or semiregular bipartite graph.

www.ejgta.org
Some new upper bounds for the inverse sum indeg index of graphs | Akbar Ali et al. Equality holds if and only if G is regular or semiregular bipartite graph.
Next, we derive an upper bound on the ISI index in terms of graph parameters m, e , e and topological indices M 2 , ⇧ 2 , ⇧ ⇤ 1 . Theorem 3.4. If G is a simple connected graph with m 1 edges then with equality if and only if G is regular or semiregular bipartite graph.
Proof. Using the arithmetic-geometric mean inequality for real numbers (see e.g. [25]), we have From (17) and (4), we obtain (16). The equality sign holds throughout in (17) if and only if d i d j (d i + d j ) = c, c = constant, for every edge of G. Therefore, equality in (17), and hence in (16), is attained if and only if G is regular or semiregular bipartite graph.
Equality holds if and only if G is regular or semiregular bipartite graph.

The best possible upper bound on the ISI index for binary trees
Sedlar et al. [31] derived the best possible upper bounds on the invariant ISI for several graph families. In [31], finding best possible upper bound on the aforementioned invariant for molecular trees (graphs representing alkanes) was left as an open problem. In this section, we will see that this problem can be easily solved for the case of binary trees [1] (that is, the trees with maximum degree at most 3). Binary trees actually form a subclass of the class of all molecular trees.
Because there is only one n-vertex tree for n  3, so the problem of finding a bound on any topological index for trees make sense if n 4. Proof. Let x i,j be the number of edges in T connecting the vertices of degrees i and j. The invariant ISI of T can be calculated using the following formula.