Delsarte clique graphs

DOI10.1016/j.ejc.2005.04.015zbMath1109.05108OpenAlexW2014656465MaRDI QIDQ866506

Akira Hiraki, Sejeong Bang, Jack H. Koolen

Publication date: 14 February 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.04.015

zbMATH Keywords

distance-regular graphsJohnson graphsHamming graphsGrassmann graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (18)

Minimum supports of eigenfunctions of graphs: a survey ⋮ Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ Delsarte set graphs with small \(c_{2}\) ⋮ Diameter bounds for geometric distance-regular graphs ⋮ Geometric distance-regular graphs without 4-claws ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ Completely regular clique graphs ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ On geometric distance-regular graphs with diameter three ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ Coverings and homotopy of a graph ⋮ On the spectral gap and the automorphism group of distance-regular graphs ⋮ Geometric antipodal distance-regular graphs with a given smallest eigenvalue ⋮ Distance-regular graphs without 4-claws ⋮ Completely regular clique graphs. II

Cites Work

• Unnamed Item
• A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
• A new distance-regular graph associated to the Mathieu group \(M_{10}\)
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• Problems in algebraic combinatorics
• A Higman-Haemers inequality for thick regular near polygons
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• A new family of distance-regular graphs with unbounded diameter

This page was built for publication: Delsarte clique graphs