The vertex connectivity of some classes of divisible design graphs

DOI10.33048/SEMI.2022.19.038MaRDI QIDQ6396394zbMATH OpenFDO

Authors Dmitry Panasenko

Publication date 13 April 2022

Full work available at URL https://doi.org/10.33048/SEMI.2022.19.038

Abstract: 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 exactly $lambd{a}_1$ common neighbours, and two vertices from different classes have exactly $lambd{a}_2$ common neighbours. In this paper, we find the vertex connectivity of some classes of divisible design graphs, in particular, we present examples of divisible design graphs, whose vertex connectivity is less than $k$, where $k$ is the degree of a vertex. We also show that the vertex connectivity a divisible design graphs may be less than $k$ by any power of 2.

This page was built for publication: The vertex connectivity of some classes of divisible design graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396394)