9 citations · 30 across the 31 of their papers we have counts for
5 papers · 1 filter
On uniform Higmanian association schemes
Grigory Ryabov
An imprimitive symmetric indecomposable association scheme of rank is said to be Higmanian. In the present paper, we prove a necessary and sufficient condition for a Higmanian…
On separability of Tatra association schemes
Grigory Ryabov
A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero -dimensional vectors modulo some subgrou…
On Neumaier Cayley graphs
Rhys J. Evans, Sergey Goryainov, Grigory Ryabov +1
In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further…
Divisible design graphs from Higmanian association schemes
Grigory Ryabov
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a…
Directed strongly regular graphs and divisible design graphs from Tatra association schemes
Mikhail Muzychuk, Grigory Ryabov
In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. W…