Completely regular clique graphs. II
DOI10.1007/S10801-015-0639-5zbMATH Open1331.05173OpenAlexW4251274503MaRDI QIDQ256544FDOQ256544
Authors: H. 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
Recommendations
association schemecompletely regular codedistance-regular graphdistance-semiregular graphsubconstituent algebraTerwilliger algebra
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Enumeration in graph theory (05C30) 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 distance-regular graph; thin modules with endpoint one
- The subconstituent algebra of a strongly regular graph
- Title not available (Why is that?)
- Edge-distance-regular graphs are distance-regular
- Completely regular clique graphs
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- Title not available (Why is that?)
- 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
Cited In (5)
This page was built for publication: Completely regular clique graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256544)
