Vertex connectivity of Deza graphs with parameters of complements to Seidel graphs
Combinatorics
2021-03-02 v1
Abstract
In this paper we find the vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. In particular, we present an infinite family of strictly Deza graphs whose vertex connectivity is equal to , where is the valency.
Cite
@article{arxiv.1802.04476,
title = {Vertex connectivity of Deza graphs with parameters of complements to Seidel graphs},
author = {Sergey V. Goryainov and Dmitry I. Panasenko},
journal= {arXiv preprint arXiv:1802.04476},
year = {2021}
}