Enumeration of strictly Deza graphs with at most 21 vertices
Combinatorics
2022-10-20 v4
Abstract
A Deza graph with parameters is a -regular graph with vertices such that any two distinct vertices have or common neighbours, where . 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.
Keywords
Cite
@article{arxiv.2102.10624,
title = {Enumeration of strictly Deza graphs with at most 21 vertices},
author = {Sergey Goryainov and Dmitry Panasenko and Leonid Shalaginov},
journal= {arXiv preprint arXiv:2102.10624},
year = {2022}
}