9 citations · 17 across the 4 of their papers we have counts for
5 papers · 1 filter
On eigenfunctions of the block graphs of geometric Steiner systems
Sergey Goryainov, Dmitry Panasenko
This paper lies in the context of the studies of eigenfunctions of graphs having minimum cardinality of support. One of the tools is the weight-distribution bound, a lower bound on…
The vertex connectivity of some classes of divisible design graphs
Dmitry Panasenko
A -regular graph is called a divisible design graph if its vertex set can be partitioned into classes of size , such that two distinct vertices from the same class have e…
Classification of divisible design graphs with at most 39 vertices
Dmitry Panasenko, Leonid Shalaginov
A -regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into classes of size , such that two distinct vertices from the s…
Enumeration of strictly Deza graphs with at most 21 vertices
Sergey Goryainov, Dmitry Panasenko, Leonid Shalaginov
A Deza graph with parameters is a -regular graph with vertices such that any two distinct vertices have or common neighbours, where . A Deza…
The smallest strictly Neumaier graph and its generalisations
Rhys J. Evans, Sergey Goryainov, Dmitry Panasenko
A regular clique in a regular graph is a clique such that every vertex outside of the clique is adjacent to the same positive number of vertices inside the clique. We continue the…