Completely regular clique graphs
DOI10.1007/S10801-013-0485-2zbMATH Open1297.05268OpenAlexW2018542300MaRDI QIDQ402941FDOQ402941
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
Recommendations
association schemecompletely regular codedistance-regular graphdistance-semiregular graphsubconstituent algebraTerwilliger algebra
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Completely regular codes
- Distance biregular bipartite graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- The subconstituent algebra of a strongly regular graph
- Edge-distance-regular graphs are distance-regular
- Title not available (Why is that?)
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Delsarte set graphs with small \(c_{2}\)
- Delsarte clique graphs
- An algebraic characterization of completely regular codes in distance-regular graphs
- Edge-distance-regular graphs
- Distance-regular \((0,\alpha)\)-reguli
- Distance-regular graphs and \((\alpha,\beta)\)-geometries
- Intriguing sets of vertices of regular graphs
Cited In (6)
- Completely regular clique graphs. II
- 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
- Edge-regular graphs with regular cliques
- The Terwilliger algebra of the incidence graph of the Hamming graph
This page was built for publication: Completely regular clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402941)
