Walk-regular divisible design graphs

DOI10.1007/S10623-013-9861-0MaRDI QIDQ2249653zbMATH OpenOpenAlexFDO

Authors Dean Crnković, Willem H. Haemers

Publication date 3 July 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-013-9861-0

zbMATH Keywords

divisible designHadamard matrixwalk-regular graphdivisible design graph\((v, k\lambda )\)-graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph designs and isomorphic decomposition (05C51)

Recommendations

• Divisible design digraphs
• Divisible design graphs
• Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• Divisible design Cayley digraphs

Cites work

• Divisible design graphs
• Feasibility conditions for the existence of walk-regular graphs
• Regular graphs with four eigenvalues
• Spectra of graphs
• Symmetric group divisible designs with the dual property
• \((v,k,\lambda)\)-graphs and polarities of \((v,k,\lambda)\)-designs

Cited in

(17)

• Divisible design graphs from the symplectic graph
• Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
• Divisible design digraphs
• New constructions of divisible design Cayley graphs
• Spectra of strongly Deza graphs
• 2-walk-regular dihedrants from group-divisible designs
• Classification of divisible design graphs with at most 39 vertices
• Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
• Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
• Divisible design graphs
• On divisible design Cayley graphs
• Deza graphs with parameters \((n,k,k-1,a)\) and \(\beta=1\)
• Enumeration of strictly Deza graphs with at most 21 vertices
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• Construction of divisible design graphs using affine designs
• On a family of divisible design digraphs
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs

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)