The vertex connectivity of some classes of divisible design graphs

Dmitry Panasenko

A $k$-regular graph is called a divisible design graph if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have e…