Infinite series of Deza graphs with strongly regular children
Mikhail P. Golubyatnikov
Abstract
A graph Γ is called a Deza graph with parameters (n, k, b, a) if it has exactly n vertices, is k-regular, and for any two distinct vertices u and v, the number of common neighbors of u and v is either a or b. The graphs Δ1 and Δ2, which have the same vertex set as Γ, and in which two vertices are adjacent if they have a or b common neighbours, respectively, are called the children of the Deza graph. If, for a Deza graph Γ, both Δ1 and Δ2 are strongly regular graphs, then Γ is called a strongly Deza graph. In this work, we present a construction of an infinite family of strongly Deza graphs, for which the children Δ1 and Δ2 are strongly regular graphs with the same parameters as the graphs NO n(5) and NO n(5).
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato