RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2025 Volume 31, Number 4, Pages 281–289 (Mi timm2229)

Deza–Cayley graphs from difference sets

G. K. Ryabov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: A regular graph $\Gamma$ is called a Deza graph if there exist nonnegative integers $a$ and $b$ such that any two distinct vertices of $\Gamma$ have either $a$ or $b$ common neighbors. A subset $R$ of a group $G$ is called a relative difference set in $G$ if there exist a subgroup $N$ of $G$ and a nonnegative integer $\lambda$ such that every element of $G\setminus N$ has exactly $\lambda$ representations in the form $g_1g_2^{-1}$, where $g_1,g_2\in R$, and no non-identity element of $N$ has such a representation. If $N$ is trivial, then $R$ is defined to be a difference set. In the present paper, we provide several new constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on usage of (relative) difference sets.

Keywords: Deza graphs, Cayley graphs, difference sets.

MSC: 05B10, 20C05, 05E30

Received: 10.08.2025
Revised: 02.09.2025
Accepted: 08.09.2025

Language: English

DOI: 10.21538/0134-4889-2025-31-4-281-289



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026