Diameter bounds for geometric distance-regular graphs

DOI10.1016/j.disc.2017.08.036zbMath1372.05056OpenAlexW2760698131MaRDI QIDQ2411625

Sejeong Bang

Publication date: 24 October 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.036

zbMATH Keywords

Johnson graphsmallest eigenvaluediameter boundgeometric distance-regular graphinduced subgraph \(K_{2,1,1}\)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

On bounding the diameter of a distance-regular graph ⋮ Geometric antipodal distance-regular graphs with a given smallest eigenvalue ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Delsarte clique graphs
• 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
• On geometric distance-regular graphs with diameter three
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist