Involutory Cayley Graphs Overview

• Involutory Cayley graphs are defined by a generating set of involutions (s² = 1), which ensures every edge is undirected and embodies self-inverse symmetry.
• They are studied across group theory, ring theory, and quandle theory, providing models such as cube groups, toroidal ring graphs, and explicit quandle presentations.
• This framework imposes strong combinatorial rigidity that facilitates unique normal forms, connectivity criteria, and decompositions via decorated graphs and factorization methods.

Searching arXiv for relevant papers on involutory Cayley graphs and closely related formulations. An involutory Cayley graph is a Cayley graph whose generating or connection set consists of involutions, so that adjacency is induced by elements satisfying an order-two condition. In the group-theoretic setting, if $G$ is a group and $S\subseteq G$ is a generating set of involutions, $s^2=1$ for all $s\in S$, then the corresponding Cayley graph is undirected and each edge corresponds to multiplying by an involution. This framework appears in several distinct but related contexts: finite groups whose Cayley graphs are hypercubes, finite involutory quandles with explicit Cayley graph models, Cayley graphs attached to conjugacy classes containing involutory phenomena, and additive Cayley graphs of commutative rings in which adjacency is defined by the condition $(x-y)^2=1$ (Hagemeyer et al., 2011, Mellor, 2019, Dona et al., 2024, Keshavarzi et al., 2 Aug 2025, Keshavarzi et al., 2 Aug 2025). The shared theme is that involutions impose strong combinatorial rigidity, frequently yielding decompositions, parity constraints, explicit presentations, and reducibility phenomena.

1. Group-theoretic definition and the cube-group paradigm

A particularly rigid instance is the cube group. A pair $(G,S)$ is a cube group of rank $n$ when $G$ is generated by a set $S$ of involutions and the Cayley graph $Cay(G,S)$ is isomorphic to the $S\subseteq G$0-skeleton of the $S\subseteq G$1-cube (Hagemeyer et al., 2011). The defining condition is

$S\subseteq G$2

Because every generator satisfies

$S\subseteq G$3

every edge is undirected, and each coordinate direction of the cube is represented by an involution. In this sense, cube groups are a special class of involutory Cayley graphs (Hagemeyer et al., 2011).

The same source gives a geometric reformulation: $S\subseteq G$4 is a cube group if and only if it acts on a cube so that the action is simply-transitive on the vertices and every edge stabilizer is nontrivial (Hagemeyer et al., 2011). This identifies group elements with vertices and encodes the involutory nature of the generating moves through nontrivial edge stabilizers. The action further extends to an orthogonal linear action on $S\subseteq G$5, called the geometric representation (Hagemeyer et al., 2011).

A key structural consequence is that cube groups admit a “boolean” normal form. There exists an ordering $S\subseteq G$6 of $S\subseteq G$7 such that

$S\subseteq G$8

and every $S\subseteq G$9 has a unique expression

$s^2=1$0

Since each $s^2=1$1 has order $s^2=1$2, the vertex set behaves like a binary coordinate system. The paper also proves that if $s^2=1$3 has rank at least $s^2=1$4, then the geometric representation is reducible (Hagemeyer et al., 2011). This reducibility follows from invariant subsets of the generating set under the associated permutation action.

2. Presentations, decorated graphs, and square relations

The combinatorial presentation theory of cube groups supplies one of the clearest formal models for involutory Cayley graphs. The relevant device is a decorated graph $s^2=1$5, where each $s^2=1$6 is an involution fixing $s^2=1$7: $s^2=1$8 From this data one defines trajectories by

$s^2=1$9

A decorated graph is admissible when every trajectory is $s\in S$0-periodic,

$s\in S$1

and there is no holonomy along any trajectory,

$s\in S$2

From an admissible decorated graph one defines

$s\in S$3

The structural theorem quoted there states that

$s\in S$4

that is the identity on generators (Hagemeyer et al., 2011).

These relations are intrinsically involutory. The generators satisfy $s\in S$5, and the $s\in S$6-cycles of the cube yield relations

$s\in S$7

In the commuting case this becomes $s\in S$8, but in general the relation records how different involutions interact around a square (Hagemeyer et al., 2011). The dihedral example given in the source is

$s\in S$9

where the Cayley graph is the $(x-y)^2=1$0-cube (Hagemeyer et al., 2011).

A related involution-indexing mechanism appears in the study of Neumann subgroups and Cayley representations of the distant graph $(x-y)^2=1$1. There, if the generators are denoted $(x-y)^2=1$2, inversion is encoded by an involution $(x-y)^2=1$3 satisfying

$(x-y)^2=1$4

The paper further derives the recursion

$(x-y)^2=1$5

and the relations

$(x-y)^2=1$6

for $(x-y)^2=1$7 (Matraś et al., 2020). Although this is not the standard involutory Cayley-graph definition, it exhibits the same principle: edge symmetry is controlled by involution data.

3. Ring-theoretic involutory Cayley graphs

A second major definition arises for finite commutative rings with identity. If $(x-y)^2=1$8 is such a ring, the involutory Cayley graph $(x-y)^2=1$9 has vertex set $(G,S)$0, and two distinct vertices $(G,S)$1 are adjacent if and only if

$(G,S)$2

Equivalently, the graph is the Cayley graph of the additive group $(G,S)$3 with respect to

$(G,S)$4

so each vertex $(G,S)$5 is adjacent to $(G,S)$6 for every $(G,S)$7 (Keshavarzi et al., 2 Aug 2025). The paper states that $(G,S)$8 is regular of degree $(G,S)$9, and that the degree is always a power of $n$0: $n$1 (Keshavarzi et al., 2 Aug 2025).

The classification of toroidal involutory Cayley graphs of finite commutative rings is especially explicit. A central lemma asserts that if $n$2 has genus $n$3, then it is connected and $n$4-regular (Keshavarzi et al., 2 Aug 2025). The main theorem states the converse in this setting: $n$5 The rings for which this occurs are exactly the following (Keshavarzi et al., 2 Aug 2025): $n$6 and

$n$7

for odd primes $n$8 and positive integers $n$9 (Keshavarzi et al., 2 Aug 2025).

The same source uses the decomposition

$G$0

into finite local rings and the graph product identity

$G$1

where $G$2 is the direct/Kronecker product (Keshavarzi et al., 2 Aug 2025). This factorwise structure is central for connectivity and genus.

A parallel investigation for polynomial and power series rings over $G$3 defines the same graph on $G$4 or $G$5 by the same adjacency condition $G$6 (Keshavarzi et al., 2 Aug 2025). There the behavior differs sharply from the finite-ring case. The paper proves that for every $G$7,

$G$8

has infinitely many connected components, so it is always disconnected (Keshavarzi et al., 2 Aug 2025). It also proves the exact characterizations: $G$9 and

$S$0

for some odd prime $S$1 and positive integer $S$2 (Keshavarzi et al., 2 Aug 2025). The same arguments apply to $S$3 (Keshavarzi et al., 2 Aug 2025).

4. Involutory quandles and explicit Cayley graph models

The language of involutory Cayley graphs also arises in quandle theory. A quandle is a set $S$4 with operations $S$5 and $S$6 satisfying axioms A1–A3, and the involutory quandle is the quotient obtained by imposing

$S$7

This is the $S$8-quandle $S$9, for which axiom A2 becomes

$Cay(G,S)$0

so every point symmetry is an involution (Mellor, 2019). The paper emphasizes that in an involutory quandle the generators behave like involutions in free-group notation, so $Cay(G,S)$1 for each generator (Mellor, 2019).

For the family

$Cay(G,S)$2

where $Cay(G,S)$3 is a two-bridge link with $Cay(G,S)$4 right-handed half-twists and $Cay(G,S)$5 is an additional unknotted component, the involutory quandle $Cay(G,S)$6 is presented with generators $Cay(G,S)$7 and a primary relation

$Cay(G,S)$8

(Mellor, 2019). The central theorem states that the Cayley graph of $Cay(G,S)$9 is the 2-component graph in Figure 1 when $S\subseteq G$00 is odd and the 3-component graph in Figure 2 when $S\subseteq G$01 is even (Mellor, 2019). A corollary gives

$S\subseteq G$02

The graph is constructed using Winker’s enumeration process:

1. Start with vertices labeled by generators $S\subseteq G$03.
2. Add loops at each vertex to encode idempotence $S\subseteq G$04.
3. Trace each relation $S\subseteq G$05 by adding a path from $S\subseteq G$06 to $S\subseteq G$07 labeled by the word $S\subseteq G$08.
4. Collapse edges with the same label that meet at a vertex.
5. Trace the secondary relations to ensure closure (Mellor, 2019).

In an involutory quandle, edges are effectively unoriented because

$S\subseteq G$09

The resulting components are described as a chain of bigons for the $S\subseteq G$10-part and grid-like components generated by alternating $S\subseteq G$11 actions, with the parity of $S\subseteq G$12 determining whether the $S\subseteq G$13- and $S\subseteq G$14-parts merge or separate (Mellor, 2019). This suggests that involutory Cayley graphs in quandle theory are naturally organized by repeated local order-two symmetries rather than by a global group law.

5. Spectral, subgroup, and conjugacy-class aspects

Involutions also control Cayley-graph properties in contexts where the connection set is not itself wholly involutory. One example is the characterization of finite groups whose Cayley graphs of degree $S\subseteq G$15 are integral. For a finite group $S\subseteq G$16, the relevant property $S\subseteq G$17 is that for every involution $S\subseteq G$18 and every element $S\subseteq G$19,

$S\subseteq G$20

The paper states that this subgroup constraint is the key structural condition for the non-nilpotent part of the classification of finite groups whose cubic Cayley graphs are integral (Feng et al., 2021).

A basic consequence is that if $S\subseteq G$21 has property $S\subseteq G$22, then every element has order $S\subseteq G$23 or $S\subseteq G$24, all prime divisors of $S\subseteq G$25 lie in $S\subseteq G$26, and any two involutions commute (Feng et al., 2021). It further proves that a Sylow $S\subseteq G$27-subgroup $S\subseteq G$28 has exponent at most $S\subseteq G$29 and satisfies

$S\subseteq G$30

while

$S\subseteq G$31

(Feng et al., 2021). The main theorem classifies finite non-nilpotent groups with property $S\subseteq G$32 into four families, including dicyclic-type, semidirect-product, Frobenius, and special $S\subseteq G$33-group constructions (Feng et al., 2021). The connection to involutory Cayley graphs is indirect but structurally significant: the interaction of involutions with arbitrary elements dictates spectral integrality for cubic Cayley graphs.

A different large-scale phenomenon is studied for finite non-abelian simple groups. If $S\subseteq G$34 is a non-identity conjugacy class and

$S\subseteq G$35

then the paper proves that some product of boundedly many elements of $S\subseteq G$36 is an involution (Dona et al., 2024). Equivalently, the set of involutions is at bounded distance from the identity in every such Cayley graph. The explicit bounds are: $S\subseteq G$37

$S\subseteq G$38

$S\subseteq G$39

and

$S\subseteq G$40

(Dona et al., 2024). This does not define an involutory Cayley graph in the narrow sense, but it shows that involutions occupy uniformly bounded metric depth in a wide class of Cayley graphs generated by conjugacy classes.

6. Structural themes and recurrent consequences

Across these settings, several structural themes recur.

Setting	Involutory mechanism	Main consequence
Cube groups	Generators satisfy $S\subseteq G$41	Binary normal form and reducible geometric representation (Hagemeyer et al., 2011)
Ring graphs	Adjacency given by $S\subseteq G$42	Regularity by $S\subseteq G$43; toroidal iff connected and $S\subseteq G$44-regular (Keshavarzi et al., 2 Aug 2025)
Involutory quandles	$S\subseteq G$45	Explicit finite Cayley graphs with parity-controlled components (Mellor, 2019)
Cubic integral Cayley graphs	Restrictions on $S\subseteq G$46 for involution $S\subseteq G$47	Classification of relevant non-nilpotent groups (Feng et al., 2021)
Conjugacy-class Cayley graphs	Involutions at bounded distance	Uniform distance bounds in finite simple groups (Dona et al., 2024)

The first theme is order-two locality. Whether the involution lies in the generating set, in the difference of ring elements, or in the quandle operation, adjacency is governed by a self-inverse move. This is explicit in $S\subseteq G$48 for cube groups (Hagemeyer et al., 2011), in $S\subseteq G$49 for ring graphs (Keshavarzi et al., 2 Aug 2025, Keshavarzi et al., 2 Aug 2025), and in $S\subseteq G$50 for involutory quandles (Mellor, 2019).

The second theme is strong decomposability. Cube groups split into products of $S\subseteq G$51-element subgroup factors and standard subgroups attached to invariant subsets (Hagemeyer et al., 2011). Finite commutative rings decompose into local factors, and their involutory Cayley graphs decompose as direct/Kronecker products (Keshavarzi et al., 2 Aug 2025). Polynomial-ring graphs decompose into infinitely many components and, in certain cases, into an infinite disjoint union of copies of $S\subseteq G$52 (Keshavarzi et al., 2 Aug 2025).

The third theme is parity and regularity constraints. In the ring setting, toroidality is equivalent to connected $S\subseteq G$53-regularity (Keshavarzi et al., 2 Aug 2025). In the polynomial setting, bipartiteness is equivalent to evenness of $S\subseteq G$54 (Keshavarzi et al., 2 Aug 2025). In the quandle setting, the parity of $S\subseteq G$55 determines whether the graph has $S\subseteq G$56 or $S\subseteq G$57 connected components (Mellor, 2019).

A plausible implication is that involutory Cayley graphs are often more rigid than general Cayley graphs because involutions impose both local reversibility and severe global combinatorial constraints. This interpretation is directly supported by the reducibility theorem for cube groups (Hagemeyer et al., 2011), the exact genus-one classification for finite rings (Keshavarzi et al., 2 Aug 2025), and the explicit component formulas for involutory quandles (Mellor, 2019).

7. Scope, variations, and common misconceptions

The term involutory Cayley graph is not used in exactly one uniform sense across the literature represented here. In one usage, it means a Cayley graph generated by involutions in a group, as in cube groups (Hagemeyer et al., 2011). In another, it means the additive Cayley graph of a commutative ring with connection set

$S\subseteq G$58

equivalently adjacency by $S\subseteq G$59 (Keshavarzi et al., 2 Aug 2025, Keshavarzi et al., 2 Aug 2025). In quandle theory, the phrase is linked to Cayley graphs of involutory quandles, where the involutory condition belongs to the quandle operation rather than to a group element of order two (Mellor, 2019). These are related but not identical notions.

A common misconception is to treat every undirected Cayley graph as involutory. Undirectedness only requires $S\subseteq G$60; it does not require every generator to satisfy $S\subseteq G$61. Cube groups provide the stricter condition $S\subseteq G$62 for all $S\subseteq G$63 (Hagemeyer et al., 2011). Likewise, in ring graphs the condition is not “difference is a unit” but specifically “difference squares to $S\subseteq G$64” (Keshavarzi et al., 2 Aug 2025, Keshavarzi et al., 2 Aug 2025).

Another misconception is that involutory structure necessarily implies connectedness. The polynomial-ring results show the opposite extreme: for every $S\subseteq G$65, $S\subseteq G$66 has infinitely many connected components (Keshavarzi et al., 2 Aug 2025). By contrast, in the toroidal finite-ring classification, connectedness is one half of the exact criterion for genus $S\subseteq G$67 (Keshavarzi et al., 2 Aug 2025). Thus involutory adjacency alone does not determine global connectivity.

Taken together, these works describe involutory Cayley graphs as a family of highly structured Cayley-type objects in which order-two symmetries govern presentations, connectivity, factorization, embeddings, and metric behavior. The cube-group theory gives a sharply constrained group model (Hagemeyer et al., 2011); ring-theoretic variants connect involutions with genus and product decompositions (Keshavarzi et al., 2 Aug 2025, Keshavarzi et al., 2 Aug 2025); quandle constructions provide explicit finite combinatorial realizations (Mellor, 2019); and broader group-theoretic investigations show how involutions shape spectral and distance properties of Cayley graphs even outside the narrow involutory definition (Feng et al., 2021, Dona et al., 2024).