On the A_-spectra of trees

From MaRDI portal
Publication:513238

DOI10.1016/J.LAA.2017.01.029zbMATH Open1357.05089arXiv1609.00835OpenAlexW2580704452MaRDI QIDQ513238FDOQ513238


Authors: Yong-Cai Geng, Sumit K. Garg Edit this on Wikidata


Publication date: 3 March 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let G be a graph with adjacency matrix A(G) and let D(G) be the diagonal matrix of the degrees of G. For every real alphainleft[0,1ight], define the matrix Aalphaleft(Gight) as [ A_{alpha}left(G ight) =alpha Dleft(G ight) +(1-alpha)Aleft(G ight) ] where 0leqalphaleq1. This paper gives several results about the Aalpha-matrices of trees. In particular, it is shown that if TDelta is a tree of maximal degree Delta, then the spectral radius of Aalpha(TDelta) satisfies the tight inequality [ ho(A_{alpha}(T_{Delta}))<alphaDelta+2(1-alpha)sqrt{Delta-1}. ] This bound extends previous bounds of Godsil, Lov'asz, and Stevanovi'c. The proof is based on some new results about the Aalpha-matrices of Bethe trees and generalized Bethe trees. In addition, several bounds on the spectral radius of Aalpha of general graphs are proved, implying tight bounds for paths and Bethe trees.


Full work available at URL: https://arxiv.org/abs/1609.00835




Recommendations




Cites Work


Cited In (72)





This page was built for publication: On the \(A_{\alpha}\)-spectra of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513238)