Completely regular clique graphs

DOI10.1007/s10801-013-0485-2zbMath1297.05268OpenAlexW2018542300MaRDI QIDQ402941

Hiroshi Suzuki

Publication date: 29 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10801-013-0485-2

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (5)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Coverings and homotopy of a graph ⋮ The Terwilliger algebra of the incidence graph of the Hamming graph ⋮ Completely regular clique graphs. II

Cites Work

• Edge-distance-regular graphs are distance-regular
• Edge-distance-regular graphs
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Delsarte set graphs with small \(c_{2}\)
• Intriguing sets of vertices of regular graphs
• Delsarte clique graphs
• Completely regular codes
• Distance biregular bipartite graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• The subconstituent algebra of a strongly regular graph
• Distance-regular \((0,\alpha)\)-reguli
• Distance-regular graphs and \((\alpha,\beta)\)-geometries
• An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Completely regular clique graphs