Thin divisible designs graphs: an interplay between fixed-point free involutions of (v,k,λ)-graphs and symmetric weighing matrices
2025/12/18 by Goryainov, Sergey, Haemers, Willem H., Konstantinova, Elena V. +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2512.16653
Abstract
In this paper, we illustrate important aspects of the interplay between weighing matrices, (v,k,λ)-graphs with fixed-point free involutions, and signed graphs with an orthogonal adjacency matrix, which arises from thin divisible design graphs. In particular, we present two new recursive constructions of regular symmetric Hadamard matrices with constant diagonal (equivalently, two new recursive constructions of strongly regular graphs) and we find a fixed-point free involution in the symplectic graph Sp(4,q), where q is odd, which leads to orthogonal signings for an infinite family of antipodal distance-regular graphs of diameter 3.
Citations
- Divisible design graphs with selfloops
- Construction of divisible design graphs using affine designs
- Divisible design graphs from the symplectic graph
- Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- New constructions of divisible design Cayley graphs
- Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and\n (4n,3n-2,3n-6,2n-2,4,n)
- On strongly regular graph with parameters (65; 32; 15; 16)
- Open problems in the spectral theory of signed graphs
- Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture
- On orthogonal matrices with zero diagonal
- Minimum number of distinct eigenvalues of graphs
- Symmetric Bush-type Hadamard matrices of order 4m4 exist for all odd m
Related