Cayley graph

Suppose that ${\displaystyle G}$ is a group and ${\displaystyle S}$ is a generating set of ${\displaystyle G}$. The Cayley graph ${\displaystyle \Gamma =\Gamma (G,S)}$ is a colored directed graph constructed as follows:[2]

• Each element ${\displaystyle g}$ of ${\displaystyle G}$ is assigned a vertex: the vertex set ${\displaystyle V(\Gamma )}$ of ${\displaystyle \Gamma }$ is identified with ${\displaystyle G.}$
• Each generator ${\displaystyle s}$ of ${\displaystyle S}$ is assigned a color ${\displaystyle c_{s}}$.
• For any ${\displaystyle g\in G}$ and ${\displaystyle s\in S,}$ the vertices corresponding to the elements ${\displaystyle g}$ and ${\displaystyle gs}$ are joined by a directed edge of colour ${\displaystyle c_{s}.}$ Thus the edge set ${\displaystyle E(\Gamma )}$ consists of pairs of the form ${\displaystyle (g,gs),}$ with ${\displaystyle s\in S}$ providing the color.

In geometric group theory, the set ${\displaystyle S}$ is usually assumed to be finite, symmetric (i.e. ${\displaystyle S=S^{-1}}$) and not containing the identity element of the group. In this case, the uncolored Cayley graph is an ordinary graph: its edges are not oriented and it does not contain loops (single-element cycles).

• Suppose that ${\displaystyle G=\mathbb {Z} }$ is the infinite cyclic group and the set ${\displaystyle S}$ consists of the standard generator 1 and its inverse (−1 in the additive notation) then the Cayley graph is an infinite path.
• Similarly, if ${\displaystyle G=\mathbb {Z} _{n}}$ is the finite cyclic group of order ${\displaystyle n}$ and the set ${\displaystyle S}$ consists of two elements, the standard generator of ${\displaystyle G}$ and its inverse, then the Cayley graph is the cycle ${\displaystyle C_{n}}$. More generally, the Cayley graphs of finite cyclic groups are exactly the circulant graphs.
• The Cayley graph of the direct product of groups (with the cartesian product of generating sets as a generating set) is the cartesian product of the corresponding Cayley graphs.[3] Thus the Cayley graph of the abelian group ${\displaystyle \mathbb {Z} ^{2}}$ with the set of generators consisting of four elements ${\displaystyle (\pm 1,0),(0,\pm 1)}$ is the infinite grid on the plane ${\displaystyle \mathbb {R} ^{2}}$, while for the direct product ${\displaystyle \mathbb {Z} _{n}\times \mathbb {Z} _{m}}$ with similar generators the Cayley graph is the ${\displaystyle n\times m}$ finite grid on a torus.

Cayley graph of the dihedral group ${\displaystyle D_{4}}$ on two generators a and b

Cayley graph of ${\displaystyle D_{4}}$, on two generators which are both self-inverse

• A Cayley graph of the dihedral group ${\displaystyle D_{4}}$ on two generators ${\displaystyle a}$ and ${\displaystyle b}$ is depicted to the left. Red arrows represent composition with ${\displaystyle a}$. Since ${\displaystyle b}$ is self-inverse, the blue lines, which represent composition with ${\displaystyle b}$, are undirected. Therefore the graph is mixed: it has eight vertices, eight arrows, and four edges. The Cayley table of the group ${\displaystyle D_{4}}$ can be derived from the group presentation

${\displaystyle \langle a,b\mid a^{4}=b^{2}=e,ab=ba^{3}\rangle .}$

A different Cayley graph of ${\displaystyle D_{4}}$ is shown on the right. ${\displaystyle b}$ is still the horizontal reflection and is represented by blue lines, and ${\displaystyle c}$ is a diagonal reflection and is represented by pink lines. As both reflections are self-inverse the Cayley graph on the right is completely undirected. This graph corresponds to the presentation

${\displaystyle \langle b,c\mid b^{2}=c^{2}=e,bcbc=cbcb\rangle .}$

• The Cayley graph of the free group on two generators ${\displaystyle a}$ and ${\displaystyle b}$ corresponding to the set ${\displaystyle S=\{a,b,a^{-1},b^{-1}\}}$ is depicted at the top of the article, and ${\displaystyle e}$ represents the identity element. Travelling along an edge to the right represents right multiplication by ${\displaystyle a,}$ while travelling along an edge upward corresponds to the multiplication by ${\displaystyle b.}$ Since the free group has no relations, the Cayley graph has no cycles. This Cayley graph is a 4-regular infinite tree and is a key ingredient in the proof of the Banach–Tarski paradox.

Part of a Cayley graph of the Heisenberg group. (The coloring is only for visual aid.)

• A Cayley graph of the discrete Heisenberg group ${\displaystyle \left\{{\begin{pmatrix}1&x&z\\0&1&y\\0&0&1\\\end{pmatrix}},\ x,y,z\in \mathbb {Z} \right\}}$

is depicted to the right. The generators used in the picture are the three matrices ${\displaystyle X,Y,Z}$ given by the three permutations of 1, 0, 0 for the entries ${\displaystyle x,y,z}$. They satisfy the relations ${\displaystyle Z=XYX^{-1}Y^{-1},\ XZ=ZX,\ YZ=ZY}$, which can also be understood from the picture. This is a non-commutative infinite group, and despite being a three-dimensional space, the Cayley graph has four-dimensional volume growth.

The group ${\displaystyle G}$ acts on itself by left multiplication (see Cayley's theorem). This may be viewed as the action of ${\displaystyle G}$ on its Cayley graph. Explicitly, an element ${\displaystyle h\in G}$ maps a vertex ${\displaystyle g\in V(\Gamma )}$ to the vertex ${\displaystyle hg\in V(\Gamma )}$. The set of edges within the Cayley graph is preserved by this action: the edge ${\displaystyle (g,gs)}$ is transformed into the edge ${\displaystyle (hg,hgs)}$. The left multiplication action of any group on itself is simply transitive, in particular, the Cayley graph is vertex transitive. This leads to the following characterization of Cayley graphs:

Sabidussi's Theorem: A graph ${\displaystyle \Gamma }$ is a Cayley graph of a group ${\displaystyle G}$ if and only if it admits a simply transitive action of ${\displaystyle G}$ by graph automorphisms (i.e. preserving the set of edges).[4]

To recover the group ${\displaystyle G}$ and the generating set ${\displaystyle S}$ from the Cayley graph ${\displaystyle \Gamma =\Gamma (G,S)}$, select a vertex ${\displaystyle v_{1}\in V(\Gamma )}$ and label it by the identity element of the group. Then label each vertex ${\displaystyle v}$ of ${\displaystyle \Gamma }$ by the unique element of ${\displaystyle G}$ that transforms ${\displaystyle v_{1}}$ into ${\displaystyle v.}$ The set ${\displaystyle S}$ of generators of ${\displaystyle G}$ that yields ${\displaystyle \Gamma }$ as the Cayley graph is the set of labels of the vertices adjacent to the selected vertex. The generating set is finite (this is a common assumption for Cayley graphs) if and only if the graph is locally finite (i.e. each vertex is adjacent to finitely many edges).

• If a member ${\displaystyle s}$ of the generating set is its own inverse, ${\displaystyle s=s^{-1}}$, then it is typically represented by an undirected edge.
• The Cayley graph ${\displaystyle \Gamma (G,S)}$ depends in an essential way on the choice of the set ${\displaystyle S}$ of generators. For example, if the generating set ${\displaystyle S}$ has ${\displaystyle k}$ elements then each vertex of the Cayley graph has ${\displaystyle k}$ incoming and ${\displaystyle k}$ outgoing directed edges. In the case of a symmetric generating set ${\displaystyle S}$ with ${\displaystyle r}$ elements, the Cayley graph is a regular directed graph of degree ${\displaystyle r.}$
• Cycles (or closed walks) in the Cayley graph indicate relations between the elements of ${\displaystyle S.}$ In the more elaborate construction of the Cayley complex of a group, closed paths corresponding to relations are "filled in" by polygons. This means that the problem of constructing the Cayley graph of a given presentation ${\displaystyle {\mathcal {P}}}$ is equivalent to solving the Word Problem for ${\displaystyle {\mathcal {P}}}$.[1]
• If ${\displaystyle f\colon G'\to G}$ is a surjective group homomorphism and the images of the elements of the generating set ${\displaystyle S'}$ for ${\displaystyle G'}$ are distinct, then it induces a covering of graphs

${\displaystyle {\bar {f}}\colon \Gamma (G',S')\to \Gamma (G,S),\quad }$ where ${\displaystyle S=f(S').}$

In particular, if a group ${\displaystyle G}$ has ${\displaystyle k}$ generators, all of order different from 2, and the set ${\displaystyle S}$ consists of these generators together with their inverses, then the Cayley graph ${\displaystyle \Gamma (G,S)}$ is covered by the infinite regular tree of degree ${\displaystyle 2k}$ corresponding to the free group on the same set of generators.

• A graph ${\displaystyle \Gamma (G,S)}$ can be constructed even if the set ${\displaystyle S}$ does not generate the group ${\displaystyle G.}$ However, it is disconnected and is not considered to be a Cayley graph. In this case, each connected component of the graph represents a coset of the subgroup generated by ${\displaystyle S}$.
• For any finite Cayley graph, considered as undirected, the vertex connectivity is at least equal to 2/3 of the degree of the graph. If the generating set is minimal (removal of any element and, if present, its inverse from the generating set leaves a set which is not generating), the vertex connectivity is equal to the degree. The edge connectivity is in all cases equal to the degree.[5]

• Every group character ${\displaystyle \chi }$ of the group ${\displaystyle G}$ induces an eigenvector of the adjacency matrix of ${\displaystyle \Gamma (G,S)}$. When ${\displaystyle G}$ is Abelian, the associated eigenvalue is ${\displaystyle \lambda _{\chi }=\sum _{s\in S}\chi (s)}$. In particular, the associated eigenvalue of the trivial character (the one sending every element to 1) is the degree of ${\displaystyle \Gamma (G,S)}$, that is, the order of ${\displaystyle S}$. If ${\displaystyle G}$ is an Abelian group, there are exactly ${\displaystyle |G|}$ characters, determining all eigenvalues.

If one, instead, takes the vertices to be right cosets of a fixed subgroup ${\displaystyle H,}$ one obtains a related construction, the Schreier coset graph, which is at the basis of coset enumeration or the Todd–Coxeter process.

Knowledge about the structure of the group can be obtained by studying the adjacency matrix of the graph and in particular applying the theorems of spectral graph theory.

The genus of a group is the minimum genus for any Cayley graph of that group.[6]

Cayley graphs were first considered for finite groups by Arthur Cayley in 1878.[2] Max Dehn in his unpublished lectures on group theory from 1909–10 reintroduced Cayley graphs under the name Gruppenbild (group diagram), which led to the geometric group theory of today. His most important application was the solution of the word problem for the fundamental group of surfaces with genus ≥ 2, which is equivalent to the topological problem of deciding which closed curves on the surface contract to a point.[7]

The Bethe lattice or infinite Cayley tree is the Cayley graph of the free group on ${\displaystyle n}$ generators. A presentation of a group ${\displaystyle G}$ by ${\displaystyle n}$ generators corresponds to a surjective map from the free group on ${\displaystyle n}$ generators to the group ${\displaystyle G,}$ and at the level of Cayley graphs to a map from the infinite Cayley tree to the Cayley graph. This can also be interpreted (in algebraic topology) as the universal cover of the Cayley graph, which is not in general simply connected.

• Vertex-transitive graph
• Generating set of a group
• Lovász conjecture
• Cube-connected cycles
• Algebraic graph theory
• Cycle graph (algebra)

• Cayley diagrams
• Weisstein, Eric W. "Cayley graph". MathWorld.