Walk-regular divisible design graphs

DOI10.1007/s10623-013-9861-0zbMath1294.05113OpenAlexW2064826930MaRDI QIDQ2249653

Willem H. Haemers, Dean Crnković

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

Hadamard matrixdivisible designwalk-regular graphdivisible design graph\((v, k\lambda )\)-graph

Mathematics Subject Classification ID

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

Related Items (9)

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 Digraphs ⋮ New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs ⋮ Spectra of strongly Deza graphs ⋮ On divisible design Cayley graphs ⋮ Enumeration of strictly Deza graphs with at most 21 vertices ⋮ Deza graphs with parameters and ⋮ New constructions of divisible design Cayley graphs

Cites Work

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

This page was built for publication: Walk-regular divisible design graphs