Walk-regular divisible design graphs
From MaRDI portal
Publication:2249653
Recommendations
Cites work
Cited in
(12)- Spectra of strongly Deza graphs
- Enumeration of strictly Deza graphs with at most 21 vertices
- Classification of divisible design graphs with at most 39 vertices
- Divisible design digraphs
- 2-walk-regular dihedrants from group-divisible designs
- On divisible design Cayley graphs
- Divisible design graphs
- New constructions of divisible design Cayley graphs
- Divisible design graphs with parameters \((4n,n+2,n-2,2,4,n)\) and \((4n,3n-2,3n-6,2n-2,4,n)\)
- Deza graphs with parameters \((n,k,k-1,a)\) and \(\beta=1\)
- Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
This page was built for publication: Walk-regular divisible design graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249653)