Generalised dual Seidel switching and Deza graphs with strongly regular children

Vladislav V. Kabanov, Elena V. Konstantinova, Leonid Shalaginov

Research output: Contribution to journalArticlepeer-review

Abstract

A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours, where b⩾a. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. In this paper we present a general approach to dual Seidel switching and investigate Deza graphs whose children are strongly regular graphs.

Original languageEnglish
Article number112238
Number of pages7
JournalDiscrete Mathematics
Volume344
Issue number3
DOIs
Publication statusPublished - Mar 2021

Keywords

  • Deza graph
  • Dual Seidel switching
  • Strictly Deza graph
  • Strongly regular graph

Fingerprint Dive into the research topics of 'Generalised dual Seidel switching and Deza graphs with strongly regular children'. Together they form a unique fingerprint.

Cite this