Abstract
We obtain a new bound connecting the first nontrivial eigenvalue of the Laplace operator on a graph and the diameter of the graph. This bound is effective for graphs with small diameter as well as for graphs with the number of maximal paths comparable to the expected value.
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 callMore From: Proceedings of the Steklov Institute of Mathematics
Paper Title
Journal
Date
