4 citations · 5 across the 15 of their papers we have counts for
5 papers · 1 filter
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.
Completely regular codes in graphs covered by a Hamming graph
Sergey Goryainov, Denis Krotov
In Cayley graphs on the additive group of a small vector space over GF, , we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the…
Second largest maximal cliques in small Paley graphs of square order
Huye Chen, Sergey Goryainov, Cong Hu
There is a conjecture that the second largest maximal cliques in Paley graphs of square order have size , where , and split into two orbi…
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…
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…