- Research
- Open Access
On the atom-bond connectivity index and radius of connected graphs
- Zhibin Du^{1}Email author
https://doi.org/10.1186/s13660-015-0714-4
© Du 2015
- Received: 13 December 2014
- Accepted: 25 May 2015
- Published: 11 June 2015
Abstract
Let G be a connected graph with edge set \(E (G)\). The atom-bond connectivity index (ABC index for short) is defined as \(ABC (G) = \sum_{uv \in E (G)} \sqrt{ \frac{d_{G} (u)+d_{G} (v)-2}{d_{G} (u) d_{G} (v)} }\), where \(d_{G} (u)\) denotes the degree of vertex u in G. The research of ABC index of graphs is active these years, and it has found a lot of applications in a variety of fields. In this paper, we will focus on the relationship between ABC index and radius of connected graphs. In particular, we determine the upper and lower bounds of the difference between ABC index and radius of connected graphs.
Keywords
- atom-bond connectivity index
- degree of vertices
- radius
MSC
- 05C12
- 05C35
- 92E10
1 Introduction
Let G be a connected graph with vertex set \(V (G)\) and edge set \(E (G)\). For \(v \in V (G)\), let \(d_{G} (v)\) denote the degree of vertex v in G.
In chemical graph theory, we usually use a graph to represent a molecule graph. One of the most useful tools to study and predict various properties of molecule graphs is the topological indices, which are used directly as simple numerical descriptors in quantitative structure property relationships (QSPR) and quantitative structure activity relationships (QSAR) [1].
Initially, in the light of the close relationship between the ABC index and the heats of formation of alkanes, the ABC index became an efficient tool to model the thermodynamic properties of organic chemical compounds [2]. In 2008, Estrada [3] elaborated a novel quantum-theory-like justification for the ABC index and explained the stability of branched alkanes.
Since then, the research on the ABC index of graphs becomes rather active. Xing et al. [4] presented an upper bound for the ABC index of connected graphs with fixed number of vertices, number of edges and maximum degree. Das [5] established the lower and upper bounds on ABC index of graphs and trees and showed that these bounds are best possible. Fath-Tabar et al. [6] considered the effect on the ABC index of graphs under some graph operations. More results on ABC index of graphs can be found in [7–9], especially for trees [10–12].
In a connected graph G, for \(v \in V(G)\), the eccentricity of v in G is defined as the maximum distance from v to another vertex of G. The radius of G, denoted by \(r (G)\), is the minimum eccentricity among the vertices in G.
In this paper, we will study the relationship between the ABC index and radius of connected graphs. In particular, we determine the upper and lower bounds of \(ABC (G) - r (G)\) for connected graphs G.
2 Preliminaries
For an edge subset M of the graph G, let \(G-M\) denote the graph obtained from G by deleting the edges in M, and for an edge subset \(M^{*}\) of the complement of G, let \(G+M^{*}\) denote the graph obtained from G by adding the edges in \(M^{*}\). In particular, if \(M = \{ u v \}\), then we write \(G - u v\) for \(G - \{ u v \}\), and if \(M^{*} = \{ u v \}\), then we write \(G + u v\) for \(G + \{ u v \}\).
The following result reveals that the deletion of an edge from a graph would decrease the ABC index.
Lemma 1
([7], Theorem 2)
As an immediate application of Lemma 1, we know that the complete graph is the unique graph with maximum ABC index among connected graphs. Furthermore, we can deduce that the upper bound of \(ABC (G) - r (G)\) would be uniquely attained by the complete graph.
Proposition 1
In the following, we will consider the lower bound of \(ABC (G) - r (G)\) for connected graphs G and show that this lower bound would be uniquely attained by the path.
3 Lemmas
First we give several additional lemmas which will be used in our proof later.
Lemma 2
([7], Lemma 2)
A vertex of degree 1 is said to be a pendent vertex, while a vertex of degree at least 2 is said to be a non-pendent vertex.
Lemma 3
Proof
Denote by a the number of non-pendent neighbors of v in G. According to the hypothesis, \(a = 0,1,2\).
In the following we will split the proof into two cases.
Case 1. \(u \ne v\).
Case 2. \(u = v\).
In this case, \(a = 0,1,2\). Moreover, note that \(d_{G} (v) \ge a + 2 \ge2\).
Combining Cases 1 and 2, the result follows. □
The following lemma on the radius of a tree is clear.
Lemma 4
Let G be a tree. If the diameter of G is d, then \(r(G) = \lfloor \frac{d+1}{2} \rfloor\).
In the following two lemmas, we will show that the path would attain the minimum value \(ABC(G) - r (G)\) among trees.
Lemma 5
Let G be a tree with a diametrical path P. If \(ABC(G) - r (G)\) is minimum among trees, then there is at most one vertex outside P in G.
Proof
Suppose to the contrary that there are at least two vertices outside P in G.
Since there are some vertices outside P in G, thus there exists some index, say k, such that \(|V (T_{k})| \ge2\), where \(1 \le k \le d-1\). By the choice of \(x_{k}\), it is easily seen that there are at most two non-pendent neighbors of \(x_{k}^{*}\) in G.
Then the result follows easily. □
Let \(P_{n}\) be the path on n vertices.
Lemma 6
Proof
From the hypothesis that there are at most one vertex outside P in G, we know that either G is the path \(P_{n}\), or G is a tree obtained from \(P_{n-1} = v_{1} v_{2} \cdots v_{n-1}\) by attaching a pendent vertex to \(v_{i}\), where \(2 \le i \le n - 2\).
4 The main result
Now we give the main result of this paper.
Theorem 1
Proof
Let G be a connected graph on \(n \ge2\) vertices.
If \(n = 2\), then \(G \cong P_{2}\), and thus the result holds trivially. If \(n = 3\), then either G is the path \(P_{3}\) or the triangle, and thus the result follows from a simple calculation.
Suppose in the following that \(n \ge4\).
Case 1. G is a tree.
Suppose that G is a tree with minimum value \(ABC (G) - r (G)\).
Case 2. G is not a tree.
Combining Cases 1 and 2, the result follows. □
Declarations
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant No. 11426199), Guangdong Provincial Natural Science Foundation of China (Grant No. 2014A030310277), and the Department of Education of Guangdong Province Natural Science Foundation of China (Grant No. 2014KQNCX224).
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.
Authors’ Affiliations
References
- Trinajstić, N: Chemical Graph Theory, 2nd edn. CRC Press, Boca Raton (1992) Google Scholar
- Estrada, E, Torres, L, Rodríguez, L, Gutman, I: An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J. Chem. 37A, 849-855 (1998) Google Scholar
- Estrada, E: Atom-bond connectivity and the energetic of branched alkanes. Chem. Phys. Lett. 463, 422-425 (2008) View ArticleGoogle Scholar
- Xing, R, Zhou, B, Dong, F: On atom-bond connectivity index of connected graphs. Discrete Appl. Math. 159, 1617-1630 (2011) MATHMathSciNetView ArticleGoogle Scholar
- Das, KC: Atom-bond connectivity index of graphs. Discrete Appl. Math. 158, 1181-1188 (2010) MATHMathSciNetView ArticleGoogle Scholar
- Fath-Tabar, GH, Vaez-Zadeh, B, Ashrafi, AR, Graovac, A: Some inequalities for the atom-bond connectivity index of graph operations. Discrete Appl. Math. 159, 1323-1330 (2011) MATHMathSciNetView ArticleGoogle Scholar
- Chen, J, Guo, X: Extreme atom-bond connectivity index of graphs. MATCH Commun. Math. Comput. Chem. 65, 713-722 (2011) MATHMathSciNetGoogle Scholar
- Chen, J, Liu, J, Guo, X: Some upper bounds for the atom-bond connectivity index of graphs. Appl. Math. Lett. 25, 1077-1081 (2012) MATHMathSciNetView ArticleGoogle Scholar
- Das, KC, Gutman, I, Furtula, B: On atom-bond connectivity index. Chem. Phys. Lett. 511, 452-454 (2011) View ArticleGoogle Scholar
- Furtula, B, Graovac, A, Vukičević, D: Atom-bond connectivity index of trees. Discrete Appl. Math. 157, 2828-2835 (2009) MATHMathSciNetView ArticleGoogle Scholar
- Gutman, I, Furtula, B, Ahmadi, MB, Hosseini, SA, Nowbandegani, PS, Zarrinderakht, M: The ABC index conundrum. Filomat 27, 1075-1083 (2013) MathSciNetView ArticleGoogle Scholar
- Xing, R, Zhou, B, Du, Z: Further results on atom-bond connectivity index of trees. Discrete Appl. Math. 158, 1536-1545 (2011) MathSciNetView ArticleGoogle Scholar