Enumeration of strictly Deza graphs with at most 21 vertices

21 Feb 2021  ·  Sergey Goryainov, Dmitry Panasenko, Leonid Shalaginov ·

A Deza graph $\Gamma$ 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 \ge a$. A Deza graph of diameter 2 which is not a strongly regular graph is called a strictly Deza graph... We find all 139 strictly Deza graphs up to 21 vertices. read more

PDF Abstract
No code implementations yet. Submit your code now