Divisible design graphs

DOI10.1016/J.JCTA.2010.10.003MaRDI QIDQ2431260zbMATH OpenOpenAlexFDO

Authors Willem H. Haemers, H. Kharaghani, Maaike A. Meulenberg

Publication date 11 April 2011

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2010.10.003

zbMATH Keywords

strongly regular graphgroup divisible designdeza graph(\(v, k, \lambda\))-graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51)

Recommendations

• Divisible design digraphs
• New constructions of divisible design Cayley graphs
• Divisible design Cayley digraphs
• Divisible design digraphs and association schemes
• Walk-regular divisible design graphs

Cites work

• scientific article; zbMATH DE number 3935054 (Why is no real title available?)
• scientific article; zbMATH DE number 687708 (Why is no real title available?)
• A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Deza graphs: A generalization of strongly regular graph
• Distance regular graphs of diameter 3 and strongly regular graphs
• Divisible designs with \(r-\lambda{}_ 1=1\)
• Divisible difference sets with multiplier -1
• On a class of symmetric balanced generalized weighing matrices
• Small regular graphs with four eigenvalues
• Spreads in strongly regular graphs
• Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
• Symmetric group divisible designs with the dual property
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• \((v,k,\lambda)\)-graphs and polarities of \((v,k,\lambda)\)-designs

Cited in

(33)

• Divisible design graphs from the symplectic graph
• Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
• Divisible design digraphs
• Divisible design digraphs and association schemes
• New constructions of divisible design Cayley graphs
• Divisible difference families from Galois rings \(\mathrm{GR}(4,n)\) and Hadamard matrices
• q-analogs of divisible design graphs and Deza graphs
• On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
• Divisible design Cayley digraphs
• Spectra of Deza graphs
• Divisible designs with \(r-\lambda{}_ 1=1\)
• Spectra of strongly Deza graphs
• 2-walk-regular dihedrants from group-divisible designs
• Classification of divisible design graphs with at most 39 vertices
• Self-dual codes from orbit matrices and quotient matrices of combinatorial designs
• Non-commutative association schemes and their fusion association schemes
• Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
• Covers of complete graphs and related association schemes
• Spectra of quasi-strongly regular graphs
• Deza graphs with parameters (v,k,k−2,a)
• On WL-rank of Deza Cayley graphs
• Necessary conditions for the existence of divisible designs
• The vertex connectivity of some classes of divisible design graphs
• On WL-rank and WL-dimension of some Deza circulant 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
• Generalised dual Seidel switching and Deza graphs with strongly regular children
• Walk-regular divisible design graphs
• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• 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: Divisible design graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431260)