A spectral bound for vertex-transitive graphs and their spanning subgraphs
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Dokumenter
- Fulltext
Forlagets udgivne version, 871 KB, PDF-dokument
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 vertex-Cheeger constant. We also prove an analogous result for a large class of irregular graphs, obtained as spanning subgraphs of vertex-transitive graphs. Using a result of Babai, we obtain a lower bound for the smallest eigenvalue of the normalised adjacency operator of a vertex-transitive graph in terms of its diameter and its degree.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Algebraic Combinatorics |
Vol/bind | 6 |
Udgave nummer | 3 |
Sider (fra-til) | 689-706 |
Antal sider | 18 |
ISSN | 2589-5486 |
DOI | |
Status | Udgivet - 2023 |
Bibliografisk note
Funding Information:
Acknowledgements. We thank the anonymous reviewers and the editor for the constructive comments and suggestions. The work of the first author was supported by the ERC grant 716424 - CASe of Karim Adiprasito. The second author acknowledges the INSPIRE Faculty Award (IFA18-MA123) from the Department of Science and Technology, Government of India.
Publisher Copyright:
© 2023 Historia Actual Online.
ID: 382500709