---
title: Cayley Divisible Design Graphs
url: https://www.emergentmind.com/topics/cayley-divisible-design-graphs
type: topic
---

# Cayley Divisible Design Graphs

A Cayley divisible design graph (often abbreviated as Cayley DDG) is a highly symmetric combinatorial structure defined as a Cayley graph whose vertex set admits a canonical partition such that intra-class and inter-class pairs of vertices have precisely prescribed numbers of common neighbors. These graphs generalize the notion of strongly regular graphs and provide a rich interface between algebraic graph theory, combinatorial design theory, and group theory, with central roles played by concepts such as Deza graphs, Schur rings, and divisible difference sets. The study of Cayley DDGs encompasses undirected and directed settings and produces families exhibiting extremal algebraic properties, including graphs with maximal possible Weisfeiler–Leman rank and integral spectra.

## 1. Definitions and Algebraic Criteria

### 1.1 Structure and Parameters

A graph \(\Gamma=(V,E)\) is a divisible design graph (DDG) with parameters \((v,k,\lambda_1,\lambda_2,m,n)\) if it is simple, \(k\)-regular, has \(v=mn\) vertices, and the vertex set admits a partition into \(m\) classes (blocks) of size \(n\) such that:
- Each pair within the same class shares exactly \(\lambda_1\) common neighbors.
- Each pair from different classes shares exactly \(\lambda_2\) common neighbors.

A Cayley DDG is a DDG that arises as a Cayley graph \(\Cay(G,S)\) for some finite group \(G\) and identity-free, inverse-closed connection set \(S\subseteq G\setminus\{e\}\). The canonical partition then corresponds to the right cosets of a subgroup \(N\le G\) of size \(n\), with index \(m\) in \(G\) [1906.12162][2107.08536].

### 1.2 Divisible Difference Sets

A subset \(S\subset G\setminus\{e\}\) is a divisible difference set (DDS) relative to a subgroup \(N\le G\) if
\[
SS^{-1} = \lambda_1 (N\setminus \{e\}) + \lambda_2 (G\setminus N) + k \{e\}
\]
in the group ring \(\mathbb{Z}G\), where \(|S|=k\). This criterion guarantees that \(\Cay(G,S)\) is a DDG with the subgroup-coset partition as its canonical partition [1906.12162].

### 1.3 Deza Graphs

A Deza graph with parameters \((n,k,b,a)\) is a \(k\)-regular graph such that any two distinct vertices have either \(a\) or \(b\) common neighbors. Every DDG is a Deza graph with \(a=\lambda_1\), \(b=\lambda_2\), but with the extra structure of a canonical partition [2105.11746].

### 1.4 Directed Generalizations

In the directed setting, a divisible design digraph (DDD) has regular in-degree and out-degree, and the counts of shared in- or out-neighbors for pairs within the same or different classes are specified analogously [1910.10991][2411.05386].

## 2. Infinite Families and Explicit Constructions

Several infinite families of Cayley DDGs have been constructed using group-theoretic and combinatorial design methodologies.

### 2.1 Affine Group Construction

Let \(\mathbb{F}=\mathbb{F}_{q^r}\) with \(q\) a prime power, \(r>1\). Set \(G=\mathbb{F}^+ \rtimes \mathbb{F}^\times\) (the affine group). For a suitable selection of subspaces \(\mathcal{M}=\{M_1,\dots,M_t\}\) of \(\mathbb{F}^+\) and a permutation \(\varphi\) satisfying symmetry conditions, the connection set
\[
S = \bigcup_{i=1}^t \tau^i (N \setminus M_i)
\]
with \(\tau=\) a generator of \(\mathbb{F}^\times\), yields a DDG with explicit parameters depending on \(q\) and \(r\), where the partition is given by cosets of \(N\simeq \mathbb{F}^+\) [1906.12162].

### 2.2 Maximal WL-rank Family

Fix any odd integer \(k\ge3\). Define the group
\[
G = (C_k \rtimes C_2) \times C_2 \times C_2
\]
with \(C_k\) cyclic of order \(k\). The connection set
\[
S = b(A\setminus \{a^{-1}\}) \cup c(A \cup \{b\}) \cup \{db,dcba^{-1}\}
\]
where \(A = \langle a \rangle\) and \(b,c,d\) generate involutory subgroups, produces a Cayley DDG with parameters \((8k,2(k+1),2(k-1),2,4,2k)\). When \(k\) is odd, the Schur ring generated by \(S\) is the full group ring, so the Weisfeiler–Leman rank equals the number of vertices; the graphs are strictly Deza, divisible-design, and integral [2105.11746].

### 2.3 Heisenberg DD Digraphs

For every odd prime power \(q\), let \(H=H_3(q)\) be the Heisenberg group of order \(q^3\). Utilizing orbits under a cyclic subgroup of automorphisms, the Cayley digraphs \(\Cay(H,X_i)\), where \(X_i\) are specific DDSs, yield pairwise nonisomorphic, normal, arc-transitive Cayley DDDs with parameters \((q^3, q^2, 0, q, q^2, q)\). The family exhibits equality of neighborhood designs and uniform 2-dimensional WL type, but 3-dimensional WL distinguishes the members for \(q>9\) [2411.05386].

### 2.4 Graph Product and Block Replacement Methods

Four main infinite constructions extend the framework using Kronecker and strong products or block-replacement with Hadamard matrices, generating Cayley DDGs with broad parametric ranges and realizations on various group types [2107.08536].

## 3. Algebraic and Spectral Properties

### 3.1 Eigenvalues and Spectrum

Cayley DDGs universally admit highly structured spectra. For general parameter set \((v,k,\lambda_1,\lambda_2,m,n)\), the spectrum is
\[
\theta_0=k;\quad \theta_{1,2} = \frac{\lambda_1-\lambda_2 \pm \sqrt{(\lambda_1-\lambda_2)^2+4(k-\lambda_2)}}{2}
\]
with multiplicities \(1,\, m(n-1),\, (m-1)n\) respectively. For the maximal WL-rank family, the spectrum is explicitly integral: \(\{2(k+1),\pm2(k-1),\pm2\}\) [2105.11746][1906.12162].

### 3.2 Weisfeiler–Leman Rank and Dimension

The WL-rank of a Cayley graph is the rank of the Schur ring generated by the connection set. In the Churikov–Ryabov construction, this rank is maximal (\(|G|=8k\)), while the underlying (2-dimensional) WL algorithm still identifies these graphs (WL-dimension 2). Conversely, the Heisenberg family is indistinguishable by 2-WL but differentiable for individual members by 3-WL (WL-dimension 3, for \(q>9\)) [2105.11746][2411.05386].

### 3.3 Automorphism Groups

Cayley DDGs possess regular automorphism groups by construction. Many are vertex-transitive, and some explicit families (notably the Heisenberg digraphs) are normal and arc-transitive, with automorphism group a semidirect product of the right regular group and a subgroup of automorphisms preserving the DDS structure [2411.05386].

## 4. Classification, Finite Examples, and Open Constructions

Dedicated classification efforts, combining canonical algebraic characterizations and computational enumeration, have resolved the set of parameter-feasible Cayley DDGs for all \(v\le27\), identifying unique and non-isomorphic realizations for all but a finite number of cases [2107.08536][1910.10991]. The tables below summarize sample small parameter sets and corresponding groups:

| Parameters            | Regular Group(s)         | # Non-isomorphic |
|-----------------------|-------------------------|------------------|
| (8,3,0,1,4,2)         | \(Q_8\)                 | 1                |
| (12,5,1,2,4,3)        | \(\mathbb{Z}_{12}, D_{12}, A_4,\ldots\) | 5      |
| (27,10,9,1,3,9)       | \(\mathbb{Z}_{27}, E_{27},\ldots\)      | 4      |

Nonexistence results confirm that not every parameter set under the DDG definition is Cayley-realizable, emphasizing the combinatorial and algebraic constraints specific to group and difference-set structure [2107.08536].

## 5. Connections to Combinatorial and Algebraic Design Theory

Cayley DDGs occupy a central role linking symmetric group-divisible designs, Deza graphs, and difference-set theory. The canonical partition of a DDG aligns with the block structure of a group-divisible design. The construction and study of divisible difference sets directly translates group-theoretic properties into combinatorial regularities. Notably, the neighborhood designs of certain Cayley DDDs are symmetric group-divisible designs with isomorphic block structure over nonisomorphic underlying digraphs [2411.05386].

The interaction with Schur rings (S-rings) provides a further classification tool by encoding the orbit partition of the group under the automorphism group, directly connecting graph isomorphism, distinction under the Weisfeiler–Leman algorithm, and spectral properties [1906.12162][2105.11746].

## 6. Open Problems and Extensions

Outstanding problems focus on the precise enumeration of nonisomorphic Cayley DDGs within specific parameter classes, classification for larger graph orders, construction of new infinite families beyond Paley and affine-derived templates, and verification of conjectured connections to balanced generalized weighing matrices (BGW) for directed analogs [1910.10991][2107.08536]. The behavior of the Weisfeiler–Leman dimension for newly-constructed families, the explicit isomorphism types of neighborhood designs, and the structural role of Schur ring invariants remain active avenues of research.

The ongoing development of Cayley divisible design graphs thus continues to shape the interconnections between algebraic combinatorics, group theory, and algorithmic graph theory, leveraging deep techniques from permutation groups, difference sets, and spectral analysis.

Source: https://www.emergentmind.com/topics/cayley-divisible-design-graphs