Geometric antipodal distance-regular graphs with a given smallest eigenvalue
From MaRDI portal
Publication:2287732
Recommendations
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- On geometric distance-regular graphs with diameter three
- scientific article; zbMATH DE number 563236
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
- Diameter bounds for geometric distance-regular graphs
Cites work
- Delsarte clique graphs
- Diameter bounds for geometric distance-regular graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Distance-regular graphs
- Geometric distance-regular graphs without 4-claws
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 563236 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Line graphs, root systems, and elliptic geometry
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Strongly regular graphs with smallest eigenvalue -m
Cited in
(4)
This page was built for publication: Geometric antipodal distance-regular graphs with a given smallest eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287732)