Local properties of the spectral radius and Perron vector in graphs (Q6862418)

In this paper, the authors prove a local version of the spectral Turán inequality, showing that \(\lambda^2(G)\leq 2\sum_{e\in E(G)}\frac{c(e)-1}{c(e)}\), where \(c(e)\) is the order of the largest clique containing the edge \(e\) in \(G\). This theorem implies Nikiforov's theorem which states that for an \(n\)-vertex graph \(G\) with clique number \(\omega\) and edge number \(m\), its spectral radius \(\lambda(G)\) satisfies \(\lambda(G)\leq\sqrt{2(1-\frac{1}{\omega})m}\). Finally, a conjecture of D. Gregory (see \textit{S. M. Cioabă} [Private communication]) regarding the Perron vector of connected graphs with a given chromatic number is disproved. The authors propose a modified version of Gregory's conjecture.