Abstract
We employ the concept of average 2-degree of the vertices and, more generally, the number of walks between two vertices to introduce new upper and lower bounds for the spectral radius and the smallest eigenvalue of a graph. We, further, show how these bounds are better than previous bounds in some cases.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
