## Abstract

The main goal of this paper is to present some new lower and upper bounds for the Randic and GA indices in terms of Zagreb and modified Zagreb indices.

**MSC:** 05C05, 05C20, 05C90.

### Similar content being viewed by others

## Dedication

Dedicated to Professor Hari M Srivastava.

## 1 Introduction and preliminaries

A systematic study of *topological indices* is one of the most striking aspects in many branches of mathematics with its applications and various other fields of science and technology. A topological index is a numeric quantity from the structural graph of a molecule. Usage of topological indices in chemistry began in 1947 when H. Wiener developed the most widely known topological descriptor, namely the Wiener index, and used it to determine physical properties of types of alkanes known as paraffin (see, for instance, [1–3]).

Let *G* be a simple graph with the vertex-set V(G) and the edge-set E(G). As usual notion, the maximum vertex degree is denoted by \mathrm{\Delta}=\mathrm{\Delta}(G), while the minimum vertex degree is denoted by \delta =\delta (G). Moreover, {\delta}_{1}={\delta}_{1}(G) denotes the minimum nonpendant vertex degree in *G*. A vertex of the graph *G* is said to be *pendant* if its neighborhood contains exactly one vertex. On the other hand, an edge of a graph is said to be *pendant* if one of its vertices is pendant.

In 1975, Randic [4] introduced the connectivity index, namely *Randic index*, to reflect molecular branching. In fact, the Randic index is defined as

Furthermore, again by considering the degrees of vertices in *G*, Vukicević and Furtula [5] developed the *Geometric-arithmetic index*, shortly GA index, which is defined by

In the following, we recall two fundamental indices that will be used to present some new bounds for Randic and GA indices.

The (first and second) *Zagreb indices* have been introduced by Gutman and Trinajstić [6] as the form

where {d}_{u} and {d}_{v} are the *degrees* of *u* and *v*, respectively. On the other hand, for a (molecular) graph *G*, the *modified second Zagreb index* {M}_{2}^{\ast}(G) is defined as

This paper is organized as follows. In the forthcoming section, we present lower and upper bounds on Randic index of connected graphs and trees in terms of modified Zagreb indices given in (4). The final section deals with lower and upper bounds on GA index of connected graphs and trees in terms of Zagreb indices given in (3). We note that this paper is motivated from [11].

## 2 Lower and upper bounds on Randic index

Throughout this paper, we refer the book [12] for a classical result, namely the *Pólya-Szegó inequality*. From this result, we first establish the following theorem, which will be expressed the lower bound on the Randic index.

**Theorem 1** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum nonpendant vertex degree of* *G*, *respectively*. *Then*

*Proof* For 2\le {\delta}_{1}\le {d}_{i},{d}_{j}\le \mathrm{\Delta}, we clearly have

such that the equality holds if and only if {d}_{i}={d}_{j}=\mathrm{\Delta}. We also have

with equality holding if and only if {d}_{i}={d}_{j}={\delta}_{1}.

Since *p* is the number of pendant vertices in *G*, we have total m-p number of non-pendant edges in *G*. By the Pólya-Szegó inequality, we have

This inequality can be clearly written as

From (1), we get

For \mathrm{\Delta}\ge {d}_{i}, since \frac{1}{{d}_{i}}\ge \frac{1}{\mathrm{\Delta}}, by (5) and (6), we obtain

as desired. □

**Corollary 1** *Let* *T* *be a tree of order* *n* *with* *p* *pendant vertices*, *and let* Δ *and* {\delta}_{1} *be the maximum vertex and minimum nonpendent vertex degrees of* *T*, *respectively*. *Then*

*Proof* Since the number of edges in a tree having *n* vertices is m=n-1, the proof can be done similarly as in the proof of Theorem 1. □

**Theorem 2** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum nonpendant vertex degree of* *G*, *respectively*. *Then*

*Proof* By the Cauchy-Schwarz inequality, it is clear that

which can be rewritten as

Since \frac{1}{{d}_{j}}\le \frac{1}{{\delta}_{1}} for {\delta}_{1}\le {d}_{j}, by (5) and (7), we obtain

as required. □

Now we prove another form of the upper bound for the Randic index as in the following.

**Theorem 3** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum nonpendant vertex degree of* *G*, *respectively*. *Then*

*Proof* Since \frac{1}{{\delta}_{1}^{2}} is the maximum value of \frac{1}{{d}_{i}{d}_{j}} for all edges {v}_{i}{v}_{j}\in E(G), we have

After that, by using (9) in (5), we get the bound in (8), as required. □

## 3 Lower and upper bounds on GA index

By taking Pólya-Szegó inequality into account, the next result deals with a new lower bound on GA index in terms of Zagreb index as given in (3).

**Theorem 4** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum nonpendant vertex degree of* *G*, *respectively*. *Then*

*Proof* For 2\le {\delta}_{1}\le {d}_{i},{d}_{j}\le \mathrm{\Delta}, we have

which implies

On the other hand, since we also have

the combination of these above equalities implies that

Since *p* is the number of pendant vertices in *G*, we have total m-p number of non-pendant edges in *G*. By the Pólya-Szegó inequality, we get

This calculation can be rewritten basically as follows:

From (2), we obtain

Now, for {\delta}_{1}\le {d}_{j}\le \mathrm{\Delta}, since \sqrt{{d}_{j}}\ge \sqrt{{\delta}_{1}} and \frac{1}{1+{d}_{j}}\ge \frac{1}{1+\mathrm{\Delta}}, by (10) and (11), we arrive at

Hence the result. □

**Corollary 2** *Let* *T* *be a tree of order* *n* *with* *p* *pendant vertices*, *and let* Δ *and* {\delta}_{1} *denote the maximum vertex degree and minimum non*-*pendent vertex degree of* *T*, *respectively*. *Then*

*Proof* For an order *n*, since the number of edges in a tree *T* is m=n-1, the proof can be done quite similar as the proof of Theorem 4. □

**Theorem 5** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum non*-*pendant vertex degree of* *G*, *respectively*. *Then*

*Proof* By the Cauchy-Schwarz inequality,

which can be simply indicate as

Now, for {\delta}_{1}\le {d}_{j}\le \mathrm{\Delta}, since \sqrt{{d}_{j}}\le \sqrt{\mathrm{\Delta}} and \frac{1}{1+{d}_{j}}\le \frac{1}{1+{\delta}_{1}}, by (11) and (12) we get the result, as required. □

The following theorem presents another upper bound for GA index.

**Theorem 6** *Let* *G* *be a simple connected graph of order* *n* *with* *m* *edges*, *and let* *p*, Δ *and* {\delta}_{1} *denote the number of pendant vertices*, *maximum vertex degree and minimum non*-*pendant vertex degree of* *G*, *respectively*. *Then*

*Proof* Since {\mathrm{\Delta}}^{2} is the maximum value of {d}_{i}{d}_{j} for all edges {v}_{i}{v}_{j}\in E(G), we have

Now, by using (13) in (11), we get

Hence, the result. □

## References

Estrada E, Torres L, Rodriguez L, Gutman I:

**An atom-bond connectivity index. Modelling the enthalpy of formation of alkanes.***Indian J. Chem.*1998, 37A: 849–855.Ranjini, PS, Lokesha, V, Bindusree, M, Phani Raju, M: New bounds on Zagreb indices and the Zagreb co-indices. Bol. Soc. Parana. Mat. SPM. ISSN-2175–1188 online, SPM: www.spm.uem.br/bspm

Trinajstić N:

*Chemical Graph Theory*. CRC Press, Boca Raton; 1992.Randic M:

**Characterization of molecular branching.***J. Am. Chem. Soc.*1975, 97: 6609–6615. 10.1021/ja00856a001Vukicević D, Furtula B:

**Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges.***J. Math. Chem.*2009, 4: 1369–1376.Gutman I, Trinajstić N:Graph theory and molecular orbitals. Total \frac{1}{4}

**-electron energy of alternate hydrocarbons.***Chem. Phys. Lett.*1972, 17: 535–538. 10.1016/0009-2614(72)85099-1Das KC, Gutman I, Zhou B:

**New upper bounds on Zagreb indices.***J. Math. Chem.*2009, 46: 514–521. 10.1007/s10910-008-9475-3Ranjini PS, Lokesha V:

**The Smarandache-Zagreb indices on the three graph operators.***Int. J. Math. Combin. China*2010, 3: 1–10.Ranjini PS, Lokesha V, Cangul IN:

**On the Zagreb indices of the line graphs of the subdivision graphs.***Appl. Math. Comput.*2011, 218(3):699–702. doi:10.1016/j.amc.2011.03.125Ranjini PS, Lokesha V, Rajan MA:

**On Zagreb indices of the subdivision graphs.***Int. J. Math. Sci. Eng. Appl*2010, 4: 221–228.Das KC:

**Atom-bond connectivity index of graphs.***Discrete Appl. Math.*2010, 158: 1181–1188. 10.1016/j.dam.2010.03.006Pólya G, Szegó G:

*Problems and Theorems in Analysis I: Series, Integral Calculus, Theory of Functions*. Springer, New York; 1972.

## Acknowledgements

I.N. Cangul and A.S. Cevik are partially supported by Research Project Offices of Uludag (2012-15, 2012-19 and 2012-20) and Selcuk Universities, respectively.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

All authors completed the paper together. All authors read and approved the final manuscript.

## Rights and permissions

**Open Access**
This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (
https://creativecommons.org/licenses/by/2.0
), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Lokesha, V., Shetty, B.S., Ranjini, P. *et al.* New bounds for Randic and GA indices.
*J Inequal Appl* **2013**, 180 (2013). https://doi.org/10.1186/1029-242X-2013-180

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1029-242X-2013-180