3 papers
math.CO2024
Divisible design graphs from symplectic graphs over rings with precisely three ideals
Anwita Bhowmik, Sergey Goryainov
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
math.CO2024
Tightness of the weight-distribution bound for strongly regular polar graphs
Rhys J. Evans, Sergey Goryainov, Leonid Shalaginov
In this paper we show the tightness of the weight-distribution bound for the positive non-principle eigenvalue of strongly regular (affine) polar graphs and characterise the optima…
math.CO2024
Divisible design graphs from the symplectic graph
Bart De Bruyn, Sergey Goryainov, Willem Haemers +1
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 generalization…