Delsarte set graphs with small c₂

DOI10.1007/S00373-010-0905-1zbMATH Open1221.05103OpenAlexW2129891706MaRDI QIDQ604668FDOQ604668

Akira Hiraki, Sejeong Bang, Jack H. Koolen

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

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

zbMATH Keywords

distance-regular graphJohnson graphDelsarte cliqueDelsarte set graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• A course in combinatorics.
• Title not available (Why is that?)
• Delsarte clique graphs
• Title not available (Why is that?)

Cited In (8)

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

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)