Divisible design graphs from the symplectic graph
B De Bruyn, S Goryainov, WH Haemers… - Designs, Codes and …, 2024 - Springer
A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a
(group) divisible design. Divisible design graphs were introduced in 2011 as a …
(group) divisible design. Divisible design graphs were introduced in 2011 as a …
New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
VV Kabanov - Discrete Mathematics, 2022 - Elsevier
A k-regular graph on v vertices is a divisible design graph with parameters (v, k, λ 1, λ 2, m,
n) if its vertex set can be partitioned into m classes of size n, such that any two different …
n) if its vertex set can be partitioned into m classes of size n, such that any two different …
Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs
D Crnković, A Švob - Graphs and combinatorics, 2024 - Springer
In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza
graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang …
graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang …
[PDF][PDF] Divisible design graphs from symplectic graphs over rings with precisely three ideals
A Bhowmik, S Goryainov - arXiv preprint arXiv:2412.04962, 2024 - arxiv.org
Divisible design graphs from symplectic graphs over rings with precisely three ideals Page 1
arXiv:2412.04962v1 [math.CO] 6 Dec 2024 Divisible design graphs from symplectic graphs …
arXiv:2412.04962v1 [math.CO] 6 Dec 2024 Divisible design graphs from symplectic graphs …