Completely regular clique graphs. II

DOI10.1007/s10801-015-0639-5zbMath1331.05173OpenAlexW4251274503MaRDI QIDQ256544

Hiroshi Suzuki

Publication date: 9 March 2016

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

Full work available at URL: https://doi.org/10.1007/s10801-015-0639-5

zbMATH Keywords

Terwilliger algebradistance-regular graphassociation schemesubconstituent algebracompletely regular codedistance-semiregular graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (3)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ Coverings and homotopy of a graph ⋮ The Terwilliger algebra of the incidence graph of the Hamming graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-distance-regular graphs are distance-regular
• Completely regular clique graphs
• Pseudo-distance-regularized graphs are distance-regular or distance-biregular
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Delsarte set graphs with small \(c_{2}\)
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• Parameters of association schemes that are both P- and Q-polynomial
• The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra
• Delsarte clique graphs
• Completely regular codes
• Distance biregular bipartite graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• The subconstituent algebra of a distance-regular graph; thin modules with endpoint one
• The subconstituent algebra of a strongly regular graph

This page was built for publication: Completely regular clique graphs. II