Eigenvalues and expansion of regular graphs

DOI10.1145/210118.210136zbMath0885.68117OpenAlexW2047342855MaRDI QIDQ4369891

Nabil Kahale

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/210118.210136

zbMATH Keywords

Ramanujan graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

High-girth near-Ramanujan graphs with localized eigenvectors ⋮ Slow emergence of cooperation for win-stay lose-shift on trees ⋮ Symmetric unique neighbor expanders and good LDPC codes ⋮ Randomised broadcasting: memory vs. randomness ⋮ Expander graphs and their applications ⋮ Randomness buys depth for approximate counting ⋮ Explicit expanders of every degree and size ⋮ An Introduction to Randomness Extractors ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Unnamed Item ⋮ A generalized Alon-Boppana bound and weak Ramanujan graphs ⋮ A Sample of Samplers: A Computational Perspective on Sampling ⋮ Basic Facts about Expander Graphs ⋮ Local majorities, coalitions and monopolies in graphs: A review

This page was built for publication: Eigenvalues and expansion of regular graphs