Vertex connectivity of Deza graphs with parameters of complements to Seidel graphs

TL;DR

This paper determines the vertex connectivity of Deza graphs related to complements of Seidel graphs, providing new insights into their structural properties and presenting an infinite family with specific connectivity characteristics.

Contribution

It introduces the vertex connectivity of Deza graphs with parameters of complements to Seidel graphs and constructs an infinite family with a particular connectivity value.

Findings

Vertex connectivity of Deza graphs with Seidel complement parameters determined.

An infinite family of Deza graphs with vertex connectivity equal to k-1.

Enhanced understanding of structural properties of these graphs.

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 $k-1$, where $k$ is the valency.