On the spectral gap and the diameter of Cayley graphs
Combinatorics
2020-04-22 v1 Number Theory
Abstract
We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths comparable to the expectation.
Cite
@article{arxiv.2004.10038,
title = {On the spectral gap and the diameter of Cayley graphs},
author = {Ilya D. Shkredov},
journal= {arXiv preprint arXiv:2004.10038},
year = {2020}
}
Comments
22 pages