Delsarte set graphs with small c₂

DOI10.1007/S00373-010-0905-1MaRDI QIDQ604668zbMATH OpenOpenAlexFDO

Authors Jack H. Koolen, Sejeong Bang, Akira Hiraki

Publication date 12 November 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0905-1

zbMATH Keywords

distance-regular graphJohnson graphDelsarte cliqueDelsarte set graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Delsarte clique graphs
• Asymptotic Delsarte cliques in distance-regular graphs
• Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Diameter bounds for geometric distance-regular graphs

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A course in combinatorics.
• Delsarte clique graphs

Cited in

(9)

• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• On bounding the diameter of a distance-regular graph
• Distance-regular graphs of large diameter that are completely regular clique graphs
• Coverings and homotopy of a graph
• Geometric distance-regular graphs without 4-claws
• Completely regular clique graphs. II
• Completely regular clique graphs
• Distance-regular graphs with or at least half the valency
• Delsarte clique graphs

This page was built for publication: Delsarte set graphs with small \(c_{2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604668)