A spectral version of the Moore problem for bipartite regular graphs

DOI10.5802/alco.71zbMath1428.05187arXiv1805.01056MaRDI QIDQ2278589

Hiroshi Nozaki, Sebastian M. Cioabă, Jack H. Koolen

Publication date: 5 December 2019

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.01056

zbMATH Keywords

expander; second eigenvalue; bipartite distance-regular graph; linear programming bound; bipartite regular graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90C05: Linear programming

05E30: Association schemes, strongly regular graphs

42C05: Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis

94B65: Bounds on codes

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

05C40: Connectivity