# On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph

## TL;DR

This paper explores the construction of strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph through dual Seidel switching, expanding understanding of graph transformations.

## Contribution

It introduces a method to generate new strictly Deza graphs from a known graph using dual Seidel switching.

## Key findings

- Identification of conditions for dual Seidel switching to produce Deza graphs
- Explicit construction of new strictly Deza graphs from the Berlekamp-van Lint-Seidel graph
- Enhanced understanding of graph transformations in algebraic graph theory

## Abstract

In this paper, we find strictly Deza graphs that can be obtained from the Berlekamp-van Lint-Seidel graph by applying dual Seidel switching.