Bounds on the ABC spectral radius of a tree
Abstract
Let G be a simple connected graph with vertex set {1,2,...,n} and di denote the degree of vertex i in G. The ABC matrix of G, recently introduced by Estrada, is the square matrix whose ijth entry is √((di+dj-2)/didi); if i and j are adjacent, and zero; otherwise. The entries in ABC matrix represent the probability of visiting a nearest neighbor edge from one side or the other of a given edge in a graph. In this article, we provide bounds on ABC spectral radius of G in terms of the number of vertices in G. The trees with maximum and minimum ABC spectral radius are characterized. Also, in the class of trees on n vertices, we obtain the trees having first four values of ABC spectral radius and subsequently derive a better upper bound.
Keywords
Full Text:
PDFDOI: http://dx.doi.org/10.5614/ejgta.2020.8.2.18
References
A. Chang and Q. Huang, Ordering trees by their largest eigenvalues, Linear Algebra Appl. 370 (2003), 175–184.
X. Chen, On ABC eigenvalues and ABC energy, Linear Algebra Appl. 544 (2018), 141–157.
J. Chen, J. Liu, and X. Guo, Some upper bounds for the atom-bond connectivity index of graphs, Appl. Math. Lett., 25 (2012), 1077–1081.
D. Cvetkovic and P. Rowlinson, The largest eigenvalue of a graph: A survey, Linear Multilinear Algebra, 544 (1990), 141–157.
K.C. Das, Atom-bond connectivity index of graphs, Discrete Appl. Math., 158 (2010), 1181–1188.
E. Estrada, The ABC matrix, J. Math. Chem., 55 (2017), 1021–1033.
E. Estrada, L. Torres, L. Rodrıguez, and I. Gutman, An atom-bond connectivity index: modelling the enthalpy of formation of alkanes, Indian J. Chem., 37(A) (1998), 849–855.
G.H. Fath-Tabar, B. Vaez-Zadeh, A.R. Ashrafi, and A. Graovac, Some inequalities for the atom-bond connectivity index of graph operations, Discrete Appl. Math., 159 (2011), 1323–1330.
B. Furtula, A. Graovac, and D. Vukicevic, Atom-bond connectivity index of trees, Discrete Appl. Math., 157 (2009), 2828–2835.
B. Furtula, I. Gutman, and M. Ivanovic, D. Vukicevic, Computer search for trees with minimal ABC index, Appl. Math. Comput., 219 (2012), 768–772.
L. Gan, H. Hou, and B. Liu, Some results on atom-bond connectivity index of graphs, MATCH Commun. Math. Comput. Chem., 66 (2011), 669–680.
I. Gutman and B. Furtula, Trees with smallest atom-bond connectivity index, MATCH Commun. Math. Comput. Chem., 68 (2012), 131–136.
I. Gutman, B. Furtula, and M. Ivanovic, Notes on trees with minimal atom-bond connectivity index, MATCH Commun. Math. Comput. Chem., 67 (2012), 467–482.
I. Gutman, J. Tosovic, S. Radenkovic, and S. Markovic, On atom-bond connectivity index and its chemical applicability, Indian J. Chem., 51(A) (2012), 690–694.
M. Hofmeister, On the two largest eigenvalues of trees, Linear Algebra Appl., 260 (1997), 43–59.
R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge Uni. Press, New York, (2013).
W. Lin, X. Lin, T. Gao, and X. Wu, Proving a conjecture of Gutman concerning trees with minimal ABC index, MATCH Commun. Math. Comput. Chem., 69 (2013) 549–557.
L. Lovasz, Random walks on graphs: A Survey, Combinatorics Paul Erdos is Eighty, 2 (1993) 1–46.
R. Xing, B. Zhou, and Z. Du, Further results on atom-bond connectivity index of trees, Discrete Appl. Math., 158 (2010), 1536–1545.
R. Xing, B. Zhou, and F. Dong, On atom-bond connectivity index of connected graphs, Discrete Appl. Math., 159 (2011) 1617–1630.
Refbacks
- There are currently no refbacks.
ISSN: 2338-2287
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.