The A_\alpha-spectral radius of graphs with given degree sequence

MaRDI QIDQ6302686zbMATH OpenFDO

Authors Dan Li, Yuanyuan Chen, Jixiang Meng

Publication date 7 June 2018

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 any real $alphain[0,1]$, write $A_{a}lpha(G)$ for the matrix ${\displaystyle }$A_alpha(G)=alpha D(G)+(1-alpha)A(G).${\displaystyle }$ This paper presents some extremal results about the spectral radius $ho(A_{a}lpha(G))$ of $A_{a}lpha(G)$ that generalize previous results about $ho(A_0(G))$ and $ho(A_{frac12}(G))$. In this paper, we give some results on graph perturbation for $A_{a}lpha$-matrix with $alphain[0,1)$. As applications, we characterize all extremal trees with the maximum $A_{a}lpha$-spectral radius in the set of all trees with prescribed degree sequence firstly. Furthermore, we characterize the unicyclic graphs that have the largest $A_{a}lpha$-spectral radius for a given unicycilc degree sequence.

This page was built for publication: The $A_\alpha$-spectral radius of graphs with given degree sequence

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