- Research
- Open access
- Published:

# Inequalities between degree- and distance-based graph invariants

*Journal of Inequalities and Applications*
**volumeÂ 2018**, ArticleÂ number:Â 39 (2018)

## Abstract

Inequalities provide a way to study topological indices relatively. There are two major classes of topological indices: degree-based and distance-based indices. In this paper we provide a relative study of these classes and derive inequalities between degree-based indices such as RandiÄ‡ connectivity, *GA*, *ABC*, and harmonic indices and distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, Wiener, and third *ABC* indices.

## 1 Introduction

Let \(G=(V_{G},E_{G})\) be a simple connected graph with a vertex set \(V_{G}\) and an edge set \(E_{G}\). The numbers of vertices and edges of *G* are respectively called the order *n* and the size *m* of *G*. The number of edges incident to a vertex \(p\in V_{G}\) is called the degree of *p* and is denoted by \(d_{p}\). \(M_{p}\) represents the product of degrees of all vertices of *G* which are adjacent to the vertex *p*, i.e., \(M_{p}=\prod_{pq\in E_{G}}d_{q}\). The minimum and maximum degrees of graph *G* are respectively denoted by *Î´* and Î”. If all the vertices of *G* are of the same degree *d*, then *G* is termed a regular graph of degree *d*. The distance from a vertex \(p\in V_{G}\) to a vertex \(q\in V_{G}\) is denoted by \(d(p,q)\) and is defined as the minimum number of edges lying between them. The eccentricity of a given vertex \(p\in V_{G}\) is denoted by \(\varepsilon_{p}\) and is defined as the maximum distance between *p* and any other vertex \(q\in V_{G}\). The maximum and minimum eccentricities of *G* are called the diameter \(d_{G}\) and the radius \(r_{G}\) of *G*. If all vertices of *G* are of the same eccentricity, then *G* is termed a self-centered graph and otherwise a non-self-centered graph.

A topological index is a numerical quantity which is uniquely determined for a graph and invariant under graph isomorphism. Topological indices are extensively used in chemistry as molecular descriptors. This molecular descriptor provides a convenient and efficient way of translating the chemical constitution of a molecule into a numerical value by using the graph representation of the molecule called the molecular graph. This graph invariant can be used for correlation with the physical properties of that molecule. Several topological indices are extensively used to study the quantitative structureâ€“activity (QSAR) and structureâ€“property (QSPR) relationships [1â€“3].

Generally, topological indices can be categorized in two major classes: one is degree-based indices and the other is distance-based indices. The general expression for the class of degree-based indices can be defined as

Milan RandiÄ‡ [4] presented the first degree-based topological index, called the RandiÄ‡ connectivity index \((\chi)\), which is defined from (1) by taking \(F(d_{p},d_{q})=1/\sqrt{d_{p}\cdot d_{q}}\). Estrada et al. [5] presented the atom-bond connectivity index (*ABC*) which is formulated by setting \(F(d_{p},d_{q})=\sqrt{(d_{p}+d_{q}-2)/d_{p}\cdot d_{q}}\) in (1). Vukicevic et al. [6] presented another degree-based topological index, called the geometric-arithmetic (*GA*) index, which is defined from (1) by choosing the function \(F(d_{p},d_{q})=2\sqrt{d_{p}\cdot d_{q}}/(d_{p}+d_{q})\). The harmonic index (*H*) is presented in [7] and is defined from (1) by taking \(F(d_{p},d_{q})=2/(d_{p}+d_{q})\).

The first distance-based index was introduced by the chemist Harold Wiener [8] and is called the Wiener index, defined as

The eccentricity related topological indices belong to the class of distance-based indices. The general expressions for these indices can be defined in the following ways:

The first eccentricity related topological index presented by Sharma et al. [9] is called the eccentric connectivity index \((\xi^{c})\) and is defined from (2) by taking \(F(d_{p},\varepsilon_{p})=d_{p}\cdot \varepsilon_{p}\). Gupta et al. [10] presented an eccentricity related index called the connective eccentric index (\(C^{\xi}\)), which is also formulated from (2) by setting \(F(d_{p},\varepsilon_{p})=d_{p}/\varepsilon_{p}\). Another eccentricity related index, called the augmented eccentric connectivity index (\(\xi^{ac}\)), was presented by Dureja et al. [11] and is defined by choosing \(F(M_{p},\varepsilon_{p})=M_{p}/\varepsilon_{p}\) in (3). Dae-Won Lee [12] presented the third atom-bond connectivity index \((\mathit{ABC}_{3})\) which is defined from (4) by taking the function \(F(\varepsilon_{p},\varepsilon_{q})=\sqrt{(\varepsilon_{p}+\varepsilon _{q}-2)/\varepsilon_{p}\cdot \varepsilon_{q}}\).

Inequalities provide a way to study topological indices relatively. This relative study is being conducted in three directions. One direction is to study inequalities for a topological index; this includes upper/lower bounds of topological index and inequalities for topological index between a graph and its associated transformed graph. Ji et al. [13] characterized the upper and lower bounds for the reformulated Zagreb index for trees, unicyclic and bicyclic graphs. Gao et al. [14] derived the sharp upper and lower bounds for the hyper-Zagreb index for trees, unicyclic and bicyclic graphs. In [13, 14], they used the inequality relations between a graph and its associated transformed graphs for the said indices. Wang et al. [15] presented the inequalities for general sum-connectivity indices between a graph and its several graph transformations.

The second direction is to study inequality relations between two different topological indices which belong to the same class. Lokesha et al. [16] derived some inequality relations between RandiÄ‡ and *GA* indices. Ali et al. [17] studied the inequality relations between various degree-based indices. From the class of distance-based indices, Dankelmann et al. [18] presented the inequality relation between Wiener and eccentric connectivity indices. Das et al. [19] derived the inequality relation between eccentric connectivity and Szeged indices.

The third and most significant direction is to study inequalities between topological indices which belong to two different classes. Hua et al. [20] derived the inequality relations of eccentric connectivity with the Zagreb indices. Zhou et al. [21] presented the inequalities between Wiener, hyper-Wiener, and Zagreb indices. Das et al. [22] derived the inequality relations between certain degree and distance-based topological indices.

In this paper we emphasize the relative study of topological indices belonging to two different classes. In this paper, we establish inequality relations of some degree-based indices such as RandiÄ‡, *GA*, *ABC*, and harmonic indices with various distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, Wiener, and third *ABC* indices.

## 2 Preliminaries

In this section, we recall some preliminary results for the topological indices of a connected graph related to some graph parameters, i.e., the order, the size, the radius, and the diameter.

The relation between the diameter and the radius of a connected graph is presented in the following theorem.

### Theorem 1

([23])

*Consider a connected graph having radius*
\(r_{G}\)
*and diameter*
\(d_{G}\), *then*

*and the left equality holds iff*
*G*
*is a self*-*centered graph*.

The lower and upper bounds of the eccentric connectivity index related to the radius and the diameter, respectively, are given in the following theorem.

### Theorem 2

([24])

*Consider a connected graph*
*G*
*having size*
*m*, *radius*
\(r_{G}\), *and diameter*
\(d_{G}\), *then*

*and the equality holds iff*
*G*
*is a self*-*centered graph*.

The lower and upper bounds of the connective eccentric index related to the diameter and the radius, respectively, are given in the following result.

### Theorem 3

([25])

*Consider a connected graph*
*G*
*having size*
*m*, *radius*
\(r_{G}\), *and diameter*
\(d_{G}\), *then*

*and the equality holds iff*
*G*
*is a self*-*centered graph*.

The lower and upper bounds of the augmented eccentric connectivity index related to the diameter and the radius, respectively, are presented in the following result.

### Theorem 4

([26])

*Consider a connected graph*
*G*
*having order*
*n*, *radius*
\(r_{G}\), *diameter*
\(d_{G}\), *minimum degree*
*Î´*, *and maximum degree* Î”, *then*

*and the equality holds iff*
*G*
*is a regular self*-*centered graph*.

### Theorem 5

([12])

*Consider a connected graph*
*G*
*having size*
*m*, *radius*
\(r_{G}\geq2\), *and diameter*
\(d_{G}\), *then*

*and the equality holds iff*
*G*
*is a self*-*centered graph*.

The inequality between the eccentric connectivity index and the Wiener index is presented in the following result.

### Theorem 6

([18])

*Consider a connected graph*
*G*
*having order*
\(n\geq3\), *then*

The relation between the RandiÄ‡ connectivity index and the diameter is given in the following result.

### Theorem 7

([27])

*Consider a connected graph*
*G*
*having order*
\(n\geq3\), *then*

*and the equality holds iff*
\(G \cong P_{n}\).

The relation between the *ABC* index and the radius is given in the following result.

### Theorem 8

([28])

*Consider a connected graph*
*G*
*having order*
\(n\geq2\), *then*

*and the equality holds iff*
\(G \cong P_{n}\)
*for*
\(n\geq3\).

The relation between the harmonic index and the diameter is given in the coming result.

### Theorem 9

([29])

*Consider a connected graph*
*G*
*having order*
\(n\geq4\)
*and diameter*
\(d_{G}\), *then*

*and the equality holds iff*
\(G\simeq K_{n}\).

The relations of *GA* index with RandiÄ‡ connectivity and harmonic indices are given in the following results.

### Theorem 10

([17])

*Consider a connected graph*
*G*
*having order*
\(n\geq3\), *then*

*the left and right equalities hold iff*
\(G\cong P_{3}\)
*and*
\(G\cong K_{n}\), *respectively*.

### Theorem 11

([17])

*Consider a connected graph*
*G*
*having order*
\(n\geq2\), *then*

*the left and right equalities hold iff*
\(G\cong P_{n}\)
*and*
\(G\cong K_{n}\), *respectively*.

## 3 Main results

In this section, we establish the inequality relations between the class of some degree-based indices with the class of certain distance-based indices.

### 3.1 RandiÄ‡ and *GA* indices in relation with distance-based indices

In the following theorem, we derive inequalities between the RandiÄ‡ connectivity index and certain distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, and Wiener indices.

### Theorem 12

*Consider a connected graph*
*G*
*having order*
\(n\geq3\)
*and size*
*m*, *then*

*where*
*Î´*
*denotes the minimum degree of*
*G*.

### Proof

By considering the functions \(F(d_{p},\varepsilon_{p})=d_{p}\cdot\varepsilon_{p}\), \(F(d_{p},\varepsilon_{p})=d_{p}/\varepsilon_{p}\) and \(F(M_{p},\varepsilon_{p})=M_{p}/\varepsilon_{p}\) in the general expressions for eccentricity related topological indices of any connected graph *G* as given in (2) and (3), we have eccentric connectivity, connective eccentric, and augmented eccentric connectivity indices of *G*, respectively, as follows:

From (6)â€“(8), we have the relations of these indices with the diameter of *G* as follows:

and the equality holds in each of inequalities (16)â€“(17) iff *G* is a self-centered graph. Also,

and the equality holds iff *G* is a regular self-centered graph.

Now, by considering the function \(F(d_{p},d_{q})=1/\sqrt{d_{p}\cdot d_{q}}\) in the general expression of degree-based indices as given in (1), we have the RandiÄ‡ connectivity index of *G* as follows:

From (11), we have the relation of this index with the diameter of *G* as follows:

and the equality holds iff \(G\cong P_{n}\) for \(n\geq3\).

By combining inequality (19) with inequalities (16)â€“(18), we have

The equality does not hold in each of these inequalities because if \(G\cong P_{n}\) for \(n\geq3\), then *G* cannot be a self-centered graph. After simplification, we get the required results (a), (b), and (c).

Also, from (10) we have the relation between Wiener and eccentric connectivity indices as follows:

and from result (a), we obtain

By combining this inequality with inequality (20), we get the required result (d).â€ƒâ–¡

In the following corollary, we establish inequalities between the *GA* index and certain distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, and Wiener indices.

### Corollary 1

*Consider a connected graph*
*G*
*having order*
\(n\geq3\)
*and size*
*m*, *then*

*where*
*Î´*
*denotes the minimum degree of*
*G*.

### Proof

By considering the function \(F(d_{p},d_{q})=2\sqrt{d_{p}\cdot d_{q}}/(d_{p}+d_{q})\) in the general expression of degree-based indices given in (1), we have the *GA* index of *G* as follows:

From the compound inequality (14), we have the relation of this index with the RandiÄ‡ connectivity index as follows:

With this inequality, TheoremÂ 12 implies the required results.â€ƒâ–¡

In the coming theorem, we derive an inequality between the RandiÄ‡ connectivity and the third *ABC* indices.

### Theorem 13

*Consider a connected graph*
*G*
*having order*
\(n\geq3\), *size*
*m*
*and diameter*
\(d_{G}\geq2\), *then*

### Proof

By considering the function \(F(\varepsilon_{p},\varepsilon_{q})=\sqrt{(\varepsilon_{p}+\varepsilon _{q}-2)/\varepsilon_{p}\cdot \varepsilon_{q}}\) in (4), we have the third *ABC* index as

From the lower bound of (9), we have the relation of this index with the diameter of *G* as follows:

where \(d_{G}\geq r_{G}\geq2\), and the equality holds iff *G* is a self-centered graph. It can be written as

Now, from inequality (11) we have

and the equality holds iff \(G\cong P_{n}\) for \(n\geq3\). From this inequality, we also have

By combining it with inequality (21), we obtain

where \(d_{G}\geq2\) and the equality does not hold because if \(G\cong P_{n}\) for \(n\geq3\), then *G* cannot be a self-centered graph. After simplification, we get the required result.â€ƒâ–¡

### 3.2
*ABC* index in relation with distance-based indices

In the following theorem, we derive inequalities between the *ABC* index and certain distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, and Wiener indices.

### Theorem 14

*Consider a connected graph*
*G*
*having order*
\(n\geq2\)
*and size*
*m*, *then*

*where*
*Î´*
*represents the minimum degree of*
*G*.

### Proof

By considering the function \(F(d_{p},d_{q})=\sqrt{(d_{p}+d_{q}-2)/d_{p}\cdot d_{q}}\) in the general expression (1) for degree-based indices of *G*, we have the *ABC* index of *G* as follows:

From (5) we have \(d_{G}\leq2r_{G}\). Then, from (12), we obtain the relation of this index with the diameter of *G* as follows:

and the equality holds iff \(G\cong P_{n}\) for \(n\geq3\).

By combining inequality (22) with inequalities (16)â€“(18), we have

and the equality does not hold in each of these inequalities because if \(G\cong P_{n}\) for \(n\geq3\), then *G* cannot be a self-centered graph. After simplification, we get the required results (a), (b), and (c).

Also, from result (a) we have

By combining this inequality with inequality (20), we get the required result (d).â€ƒâ–¡

In the coming theorem, we derive an inequality between the *ABC* and the third *ABC* indices.

### Theorem 15

*Consider a connected graph*
*G*
*having order*
\(n\geq2\), *size*
*m*, *and diameter*
\(d_{G}\geq2\), *then*

### Proof

From (22), we have

and the equality holds iff \(G\cong P_{n}\) for \(n\geq3\).

From this inequality, we also have

By combining it with inequality (21), we obtain

where \(d_{G}\geq2\) and the equality does not hold because if \(G\cong P_{n}\) for \(n\geq3\), then *G* cannot be a self-centered graph. After simplification, we get the required result.â€ƒâ–¡

### 3.3 Harmonic index in relation with distance-based indices

In the following theorem, we derive the inequalities between the harmonic index and certain distance-based indices such as eccentric connectivity, connective eccentric, augmented eccentric connectivity, and Wiener indices for any non-self-centered graph.

### Theorem 16

*Consider a non*-*self*-*centered graph*
*G*
*having order*
*n*
*and size*
*m*, *then*

*where* Î” *represents the maximum degree*.

### Proof

For a non-self-centered graph *G*, from (5) we have \(r_{G}< d_{G}\leq2\cdot r_{G}\). Then from the compound inequalities (6)â€“(8), we obtain the relation of the diameter of *G* with the eccentric connectivity, connective eccentric, and augmented eccentric connectivity indices as follows:

Now, by considering the function \(F(d_{p},d_{q})=2/(d_{p}+d_{q})\) in the general expression of degree-based indices as given in (1), we have the harmonic index of *G* as follows:

From (13), we obtain the relation of this index with the diameter of *G* as follows:

and the equality holds iff \(G\cong K_{n}\) for \(n\geq4\).

By combining inequality (26) with inequalities (23)â€“(25), we obtain

The equality does not exist in each of these inequalities because the complete graph \(K_{n}\) is a self-centered graph. After simplification, we get the required results (a), (b), and (c).

Also, from the compound inequality (15), we obtain

and from the result (d) of CorollaryÂ 1, we have

By combining this inequality with inequality (27), we get the required result (d).â€ƒâ–¡

In the coming theorem, we present the inequality relations of the harmonic index with eccentric connectivity and connective eccentric indices for self-centered graphs.

### Theorem 17

*Consider a self*-*centered graph*
*G*
*having order*
\(n\geq4\)
*and size*
*m*, *then*

*and the equality holds iff*
\(G\cong K_{n}\).

### Proof

For a self-centered graph *G*, from (5) we have \(d_{G}=r_{G}\). Then, from the compound inequalities (6)â€“(7), we obtain the equality relation of the diameter of *G* with the eccentric connectivity, connective eccentric, and augmented eccentric connectivity indices as follows:

By using these relations in inequality (26), we get the required results.â€ƒâ–¡

In the following theorem, we establish an inequality between harmonic and augmented eccentric connectivity indices for regular self-centered graphs.

### Theorem 18

*Consider a regular self*-*centered graph*
*G*
*of degree*
*d*
*having order*
\(n\geq4\)
*and size*
*m*, *then*

*and the equality holds iff*
\(G\cong K_{n}\).

### Proof

For a self-centered graph *G*, from (5) we have \(d_{G}=r_{G}\). Then, from the compound inequality (8), we obtain the equality relation of the diameter of *G* with the augmented eccentric connectivity indices as follows:

By using this relation in inequality (26), we get the required result.â€ƒâ–¡

In the coming theorem, we derive an inequality relation between harmonic and third *ABC* indices for non-self-centered graphs.

### Theorem 19

*Consider a non*-*self*-*centered graph*
*G*
*having order*
\(n\geq4\), *size*
*m*, *and radius*
\(r_{G}\geq2\), *then*

### Proof

For a non-self-centered graph *G*, from (5) we have \(r_{G}< d_{G}\leq2r_{G}\). By using this relation, we obtain the inequality

Now, from the compound inequality (9), we have

It can be written as

where \(r_{G}\geq2\), and the equality holds iff *G* is a self-centered graph.

By combining inequality (28) with inequality (29), we have

and the equality does not hold because *G* is a non-self-centered graph.

Also, from (13) we have

and the equality holds if and only if \(G\cong K_{n}\) for \(n\geq4\).

By combining inequality (31) with inequality (30), we obtain

After simplification, we get the required result.â€ƒâ–¡

In the following theorem, we derive an inequality between harmonic and third *ABC* indices for self-centered graphs.

### Theorem 20

*Consider a self*-*centered graph*
*G*
*having order*
\(n\geq4\), *size*
*m*, *and diameter*
\(d_{G}\geq2\), *then*

### Proof

For a self-centered graph *G*, we have \(d_{G}=r_{G}\). Then, from the compound inequality (9), we have

where \(d_{G}\geq2\).

Also, from inequality (31) we have

and the equality holds iff \(G\cong K_{n}\) for \(n\geq4\).

By using (32), we obtain

where \(d_{G}\geq2\), and the equality does not hold because if \(G\cong K_{n}\) for \(n\geq4\), then \(d_{G}=1\). After simplification, we get the desired result.â€ƒâ–¡

## 4 Conclusion

In this paper, some inequality relations have been studied between two topological indices belonging to degree-based and distance-based indices. We derived the relations of RandiÄ‡ connectivity, *GA*, *ABC*, and harmonic indices with eccentric connectivity, connective eccentric, augmented eccentric connectivity, Wiener, and third *ABC* indices. Our derived inequality relations can be very helpful in the relative study of these indices.

## References

Devillers, J., Balaban, A.T.: Topological Indices and Related Descriptors in QSAR and QSPR. Gordon & Breach, Amsterdam (1999)

Karelson, M.: Molecular Descriptors in QSAR/QSPR. Wiley-Interscience, New York (2000)

Diudea, M.V.: QSPR/QSAR Studies by Molecular Descriptors. Nova Science Publishers, Huntington (2000)

RandiÄ‡, M.: On characterization of molecular branching. J. Am. Chem. Soc.

**97**(23), 6609â€“6615 (1975)Estrada, E., Torres, L., Rodriguez, L., Gutman, I.: An atom-bond connectivity index: modelling the enthalpy of formation of alkane. Indian J. Chem.

**37A**, 849â€“855 (1998)Vukicevic, D., Furtula, B.: Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem.

**46**(4), 1369â€“1376 (2009)Fajtlowicz, S.: On conjectures of graffitiâ€”II. Congr. Numer.

**60**, 187â€“197 (1987)Wiener, H.: Structural determination of the paraffin boiling points. J. Am. Chem. Soc.

**69**, 17â€“20 (1947)Sharma, V., Goswami, R., Madan, A.K.: Eccentric connectivity index: a novel highly discriminating topological descriptor for structure-property and structure-activity studies. J. Chem. Inf. Comput. Sci.

**37**, 273â€“282 (1997)Gupta, S., Singh, M., Madan, A.K.: Connective eccentricity index: a novel topological descriptor for predicting biological activity. J. Mol. Graph. Model.

**18**, 18â€“25 (2000)Dureja, H., Madan, A.K.: Superaugmented eccentric connectivity indices: new generation highly discriminating topological descriptors for QSAR/QSPR modeling. Med. Chem. Res.

**16**, 331â€“341 (2007)Lee, D.-W.: Some lower and upper bounds on the third

*ABC*index. AKCE Int. J. Graphs Comb.**13**, 11â€“15 (2016)Ji, S., Li, X., Huo, B.: On reformulated Zagreb indices with respect to acyclic, unicyclic and bicyclic graphs. MATCH Commun. Math. Comput. Chem.

**72**, 723â€“732 (2014)Gao, W., Jamil, M.K., Javed, A., Farahani, M.R., Wang, S., Liu, J.-B.: Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs. Discrete Dyn. Nat. Soc.

**2017**, Article ID 6079450 (2017). https://doi.org/10.1155/2017/6079450Wang, H., Liu, J.-B., Wang, S., Gao, W., Akhter, S., Imran, M., Farahani, M.R.: Sharp bounds for the general sum-connectivity indices of transformation graphs. Discrete Dyn. Nat. Soc.

**2017**, Article ID 2941615 (2017). https://doi.org/10.1155/2017/2941615Lokesha, V., Shetty, B.S., Ranjini, P.S., Cangul, I.N., Cevik, A.S.: New bounds for RandiÄ‡ and

*GA*indices. J. Inequal. Appl.**2013**, 180 (2013)Ali, A., Bhatti, A.A., Raza, Z.: Further inequalities between vertex-degree-based topological indices. Int. J. Appl. Comput. Math.

**3**, 1921â€“1930 (2017)Dankelmann, P., Morgan, M.J., Mukwembi, S., Swart, H.C.: On the eccentric connectivity index and Wiener index of a graph. Quaest. Math.

**37**(1), 39â€“47 (2014)Das, K.C., Nadjafi-Arani, M.J.: Comparison between the Szeged index and the eccentric connectivity index. Discrete Appl. Math.

**186**, 74â€“86 (2015)Hua, H., Das, K.C.: The relationship between the eccentric connectivity index and Zagreb indices. Discrete Appl. Math.

**161**, 2480â€“2491 (2013)Zhou, B., Gutman, I.: Relations between Wiener, hyper-Wiener and Zagreb indices. Chem. Phys. Lett.

**394**, 93â€“95 (2004)Das, K.C., Gutman, I., Nadjafi-Arani, M.J.: Relations between distance-based and degree-based topological indices. Appl. Math. Comput.

**270**, 142â€“147 (2015)Chartrand, G., Zhang, P.: Introduction to Graph Theory. McGraw-Hill, New York (2006)

Zhou, B., Du, Z.: On eccentric connectivity index. MATCH Commun. Math. Comput. Chem.

**63**, 181â€“198 (2010)De, N.: Bounds for the connective eccentric index. Int. J. Contemp. Math. Sci.

**7**(44), 2161â€“2166 (2012)De, N.: Relationship between augmented eccentric connectivity index and some other graph invariants. Int. J. Adv. Math. Sci.

**1**(2), 26â€“32 (2013)Yang, Y., Lu, L.: The RandiÄ‡ index and the diameter of graphs. Discrete Math.

**311**, 1333â€“1343 (2011)Du, Z.: On the atom-bond connectivity index and radius of connected graphs. J. Inequal. Appl.

**2015**, 188 (2015)Liu, J.: On harmonic index and diameter of graphs. J. Appl. Math. Phys.

**1**, 5â€“6 (2013)

## Author information

### Authors and Affiliations

### Contributions

All authors contributed equally and significantly in conducting this research work and writing this paper. All authors read and approved the final manuscript.

### Corresponding author

## Ethics declarations

### Competing interests

We declare that we have no competing interests.

## Additional information

### Publisherâ€™s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## About this article

### Cite this article

Nadeem, I., Shaker, H. Inequalities between degree- and distance-based graph invariants.
*J Inequal Appl* **2018**, 39 (2018). https://doi.org/10.1186/s13660-018-1633-y

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/s13660-018-1633-y