A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues
Abstract
We prove that the diameter of any unweighted connected graph G is O(k log n/lambdak), for any k>= 2. Here, lambdak is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.