Deza Cayley graphs from difference sets
Grigory Ryabov
TL;DR
The paper constructs new Deza Cayley graphs over generalized dihedral groups by exploiting difference sets and relative difference sets, yielding two infinite families of strictly Deza graphs with explicit parameter patterns. It employs group-ring methods to verify the Deza property and develops two main constructions that produce graphs with diameter 2 or strong regularity under specified parameter conditions. It further shows how to generate additional Deza Cayley graphs through standard graph operations, expanding the known catalog of graphs in this class. The work advances understanding of how combinatorial designs translate into Deza graph families and outlines open questions about discovering further DS/RDS-based examples.
Abstract
In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.
