The A_\alpha spectral radius with given independence number n-4

arXiv2210.16466MaRDI QIDQ6415465FDOQ6415465

Authors: Xichan Liu, Ligong Wang 

Publication date: 28 October 2022

Abstract: Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D(G)$. In 2017, Nikiforov [Appl. Anal. Discrete Math., 11 (2017) 81--107] defined the matrix $A_{a}lpha(G)=alphaD(G)+(1-alpha)A(G)$ for any real $alphain[0,1]$. The largest eigenvalue of $A(G)$ is called the spectral radius of $G$, while the largest eigenvalue of $A_{a}lpha(G)$ is called the $A_{a}lpha$ spectral radius of $G$. Let $mathcal{G}_{n,i}$ be the set of graphs of order $n$ with independence number $i$. Recently, for all graphs in $mathcal{G}_{n,i}$ having the minimum or the maximum $A$, $Q$ and $A_{a}lpha$ spectral radius where $iin1,2,lfloorfracn2floor,lceilfracn2ceil+1,n-3,n-2,n-1$, there are some results have been given by Xu, Li and Sun et al., respectively. In 2021, Luo and Guo [Discrete Math., 345 (2022) 112778] determined all graphs in $mathcal{G}_{n,n-4}$ having the minimum spectral radius. In this paper, we characterize the graphs in $mathcal{G}_{n,n-4}$ having the minimum and the maximum $A_{a}lpha$ spectral radius for $alphain[frac12,1)$, respectively.

This page was built for publication: The $A_\alpha$ spectral radius with given independence number $n-4$

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