On distance-regular graphs with smallest eigenvalue at least \(- m\)

DOI10.1016/j.jctb.2010.04.006zbMath1203.05043arXiv0908.2017MaRDI QIDQ602713

Jack H. Koolen, Sejeong Bang

Publication date: 5 November 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

smallest eigenvalue; geometric distance-regular graph; geometric strongly regular graph, partial linear space

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

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

05C12: Distance in graphs

Related Items

Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions, Completely regular clique graphs. II, Asymptotic Delsarte cliques in distance-regular graphs, Completely regular clique graphs, Distance-regular graphs of large diameter that are completely regular clique graphs, A valency bound for distance-regular graphs, A new characterization of the dual polar graphs, Coverings and homotopy of a graph, Geometric distance-regular graphs without 4-claws, A characterization of Johnson and Hamming graphs and proof of Babai's conjecture, On the spectral gap and the automorphism group of distance-regular graphs, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey, Geometric antipodal distance-regular graphs with a given smallest eigenvalue, There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\), Distance-regular graphs without 4-claws, Diameter bounds for geometric distance-regular graphs, Geometric aspects of 2-walk-regular graphs, On geometric distance-regular graphs with diameter three, A note on distance-regular graphs with a small number of vertices compared to the valency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Delsarte set graphs with small \(c_{2}\)
• Delsarte clique graphs
• Distance-regular graphs with girth 3 or 4: I
• A characterization of the association schemes of bilinear forms
• Characterization of H(n,q) by the parameters
• Two remarks on Huang's characterization of the bilinear forms graphs
• Line graphs, root systems, and elliptic geometry
• Strongly regular graphs with smallest eigenvalue -m
• On a characterization of bilinear forms graphs
• Problems in algebraic combinatorics
• Geometric distance-regular graphs without 4-claws
• Distance-regular \((0,\alpha)\)-reguli
• Nonisomorphic Steiner triple systems
• Strongly regular graphs, partial geometries and partially balanced designs