arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.00835math.CO
收藏

关于树的$A_α$ -谱

On the $A_α$-spectra of trees

Vladimir Nikiforov, Germain Pastén, Oscar Rojo, Ricardo L. Soto

摘要:

设$G$是一个具有邻接矩阵$A(G)$的图,$D(G)$是$G$的度的对角矩阵.对于每个实数$α\in\left[ 0,1\right],$,定义矩阵$A_α\left(G\right) $为\[ A_α\left(G\right) =αD\left(G\right) +(1-α)A\left(G\right) \],其中$0\leqα\leq1$。本文给出了树的$A_α$ -矩阵的几个结果。特别是,它表明,如果$T_Δ$是一棵树的最大程度$Δ,$,然后$A_α(T_Δ)$的谱半径满足紧不等式\[ ρ(A_α(T_Δ))<αΔ+2(1-α)\sqrt{Δ-1}. \]这个界限延伸以前的界限Godsil,Lovász,和Stevanović。证明是基于Bethe树和广义Bethe树的$A_α$ -矩阵的一些新结果。此外,还证明了一般图的$A_α$的谱半径的几个界,其中包含路和Bethe树的紧界。

英文摘要:

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 $α\in\left[ 0,1\right],$ define the matrix $A_α\left(G\right) $ as \[ A_α\left(G\right) =αD\left(G\right) +(1-α)A\left(G\right) \] where $0\leqα\leq1$. This paper gives several results about the $A_α$-matrices of trees. In particular, it is shown that if $T_Δ$ is a tree of maximal degree $Δ,$ then the spectral radius of $A_α(T_Δ)$ satisfies the tight inequality \[ ρ(A_α(T_Δ))<αΔ+2(1-α)\sqrt{Δ-1}. \] This bound extends previous bounds of Godsil, Lovász, and Stevanović. The proof is based on some new results about the $A_α$-matrices of Bethe trees and generalized Bethe trees. In addition, several bounds on the spectral radius of $A_α$ of general graphs are proved, implying tight bounds for paths and Bethe trees.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑