Dmitry Panasenko

activity

20182023

most citedClassification of divisible design graphs with at most 39 vertices

9 citations · 17 across the 4 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

2 papers · 2 filters

math.CO2021★ 9 cited

Classification of divisible design graphs with at most 39 vertices

Dmitry Panasenko, Leonid Shalaginov

A $k$ -regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$ , such that two distinct vertices from the s…

math.CO2021★ 1 cited

Enumeration of strictly Deza graphs with at most 21 vertices

Sergey Goryainov, Dmitry Panasenko, Leonid Shalaginov

A Deza graph $Γ$ with parameters $(v, k, b, a)$ is a $k$ -regular graph with $v$ vertices such that any two distinct vertices have $b$ or $a$ common neighbours, where $b \geq a$ . A Deza…