Spectral radius minus average degree: a better bound
classification
🧮 math.CO
keywords
averagedegreeradiusspectraladjacencybetterboundbounds
read the original abstract
Collatz and Sinogowitz had proposed to measure the departure of a graph $G$ from regularity by the difference of the (adjacency) spectral radius and the average degree: $\epsilon(G)=\rho(G)-\frac{2m}{n}$. We give here new lower bounds on this quantity, which improve upon the currently known ones.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.