On distance-regular graphs with smallest eigenvalue at least \(- m\)
From MaRDI portal
Publication:602713
DOI10.1016/j.jctb.2010.04.006zbMath1203.05043arXiv0908.2017MaRDI QIDQ602713
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
smallest eigenvalue; geometric distance-regular graph; geometric strongly regular graph, partial linear space
05E30: Association schemes, strongly regular graphs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
Related Items
Completely regular clique graphs. II, Asymptotic Delsarte cliques in distance-regular graphs, Completely regular clique graphs, A valency bound for distance-regular graphs, Geometric 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
