A spectral bound for vertex-transitive graphs
Combinatorics
2022-02-09 v1
Abstract
For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its isoperimetric constant.
Cite
@article{arxiv.2104.09894,
title = {A spectral bound for vertex-transitive graphs},
author = {Arindam Biswas and Jyoti Prakash Saha},
journal= {arXiv preprint arXiv:2104.09894},
year = {2022}
}