Completely regular clique graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 832234 (Why is no real title available?)
- An algebraic characterization of completely regular codes in distance-regular graphs
- Completely regular codes
- Delsarte clique graphs
- Delsarte set graphs with small \(c_{2}\)
- Distance biregular bipartite graphs
- Distance-regular \((0,\alpha)\)-reguli
- Distance-regular graphs and \((\alpha,\beta)\)-geometries
- Distance-regularised graphs are distance-regular or distance-biregular
- Edge-distance-regular graphs
- Edge-distance-regular graphs are distance-regular
- Intriguing sets of vertices of regular graphs
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- The subconstituent algebra of a strongly regular graph
Cited in
(6)- Distance-regular graphs of large diameter that are completely regular clique graphs
- Edge-regular graphs with regular cliques
- Coverings and homotopy of a graph
- The Terwilliger algebra of the incidence graph of the Hamming graph
- Completely regular clique graphs. II
- On completely regular codes with minimum eigenvalue in geometric graphs
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)
