Cayley graph

From HandWiki
Short description: Graph defined from a mathematical group
The Cayley graph of the free group on two generators a and b
Graph families defined by their automorphisms
distance-transitive distance-regular strongly regular
symmetric (arc-transitive) t-transitive, t ≥ 2 skew-symmetric
(if connected)
vertex- and edge-transitive
edge-transitive and regular edge-transitive
vertex-transitive regular (if bipartite)
Cayley graph zero-symmetric asymmetric

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group,[1] is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem (named after Arthur Cayley), and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing expander graphs.


Let [math]\displaystyle{ G }[/math] be a group and [math]\displaystyle{ S }[/math] be a generating set of [math]\displaystyle{ G }[/math]. The Cayley graph [math]\displaystyle{ \Gamma = \Gamma(G,S) }[/math] is an edge-colored directed graph constructed as follows:[2]

  • Each element [math]\displaystyle{ g }[/math] of [math]\displaystyle{ G }[/math] is assigned a vertex: the vertex set of [math]\displaystyle{ \Gamma }[/math] is identified with [math]\displaystyle{ G. }[/math]
  • Each element [math]\displaystyle{ s }[/math] of [math]\displaystyle{ S }[/math] is assigned a color [math]\displaystyle{ c_s }[/math].
  • For every [math]\displaystyle{ g \in G }[/math] and [math]\displaystyle{ s \in S }[/math], there is a directed edge of color [math]\displaystyle{ c_s }[/math] from the vertex corresponding to [math]\displaystyle{ g }[/math] to the one corresponding to [math]\displaystyle{ gs }[/math].

Not every convention requires that [math]\displaystyle{ S }[/math] generate the group. If [math]\displaystyle{ S }[/math] is not a generating set for [math]\displaystyle{ G }[/math], then [math]\displaystyle{ \Gamma }[/math] is disconnected and each connected component represents a coset of the subgroup generated by [math]\displaystyle{ S }[/math].

If an element [math]\displaystyle{ s }[/math] of [math]\displaystyle{ S }[/math] is its own inverse, [math]\displaystyle{ s = s^{-1}, }[/math] then it is typically represented by an undirected edge.

The set [math]\displaystyle{ S }[/math] is often assumed to be finite, especially in geometric group theory, which corresponds to [math]\displaystyle{ \Gamma }[/math] being locally finite and [math]\displaystyle{ G }[/math] being finitely generated.

The set [math]\displaystyle{ S }[/math] is sometimes assumed to be symmetric ([math]\displaystyle{ S = S^{-1} }[/math]) and not containing the group identity element. In this case, the uncolored Cayley graph can be represented as a simple undirected graph.


  • Suppose that [math]\displaystyle{ G=\Z }[/math] is the infinite cyclic group and the set [math]\displaystyle{ S }[/math] consists of the standard generator 1 and its inverse (−1 in the additive notation); then the Cayley graph is an infinite path.
  • Similarly, if [math]\displaystyle{ G=\Z_n }[/math] is the finite cyclic group of order [math]\displaystyle{ n }[/math] and the set [math]\displaystyle{ S }[/math] consists of two elements, the standard generator of [math]\displaystyle{ G }[/math] and its inverse, then the Cayley graph is the cycle [math]\displaystyle{ C_n }[/math]. 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 [math]\displaystyle{ \Z^2 }[/math] with the set of generators consisting of four elements [math]\displaystyle{ (\pm 1,0),(0,\pm 1) }[/math] is the infinite grid on the plane [math]\displaystyle{ \R^2 }[/math], while for the direct product [math]\displaystyle{ \Z_n \times \Z_m }[/math] with similar generators the Cayley graph is the [math]\displaystyle{ n\times m }[/math] finite grid on a torus.
Cayley graph of the dihedral group [math]\displaystyle{ D_4 }[/math] on two generators a and b
Cayley graph of [math]\displaystyle{ D_4 }[/math], on two generators which are both self-inverse
  • A Cayley graph of the dihedral group [math]\displaystyle{ D_4 }[/math] on two generators [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math] is depicted to the left. Red arrows represent composition with [math]\displaystyle{ a }[/math]. Since [math]\displaystyle{ b }[/math] is self-inverse, the blue lines, which represent composition with [math]\displaystyle{ b }[/math], are undirected. Therefore the graph is mixed: it has eight vertices, eight arrows, and four edges. The Cayley table of the group [math]\displaystyle{ D_4 }[/math] can be derived from the group presentation [math]\displaystyle{ \langle a, b \mid a^4 = b^2 = e, a b = b a^3 \rangle. }[/math] A different Cayley graph of [math]\displaystyle{ D_4 }[/math] is shown on the right. [math]\displaystyle{ b }[/math] is still the horizontal reflection and is represented by blue lines, and [math]\displaystyle{ c }[/math] 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 [math]\displaystyle{ \langle b, c \mid b^2 = c^2 = e, bcbc = cbcb \rangle. }[/math]
  • The Cayley graph of the free group on two generators [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math] corresponding to the set [math]\displaystyle{ S = \{a, b, a^{-1}, b^{-1}\} }[/math] is depicted at the top of the article, with [math]\displaystyle{ e }[/math] being the identity. Travelling along an edge to the right represents right multiplication by [math]\displaystyle{ a, }[/math] while travelling along an edge upward corresponds to the multiplication by [math]\displaystyle{ b. }[/math] Since the free group has no relations, the Cayley graph has no cycles: it is the 4-regular infinite tree. It is a key ingredient in the proof of the Banach–Tarski paradox.
  • More generally, the Bethe lattice or Cayley tree is the Cayley graph of the free group on [math]\displaystyle{ n }[/math] generators. A presentation of a group [math]\displaystyle{ G }[/math] by [math]\displaystyle{ n }[/math] generators corresponds to a surjective homomorphism from the free group on [math]\displaystyle{ n }[/math] generators to the group [math]\displaystyle{ G, }[/math] defining a map from the Cayley tree to the Cayley graph of [math]\displaystyle{ G }[/math]. Interpreting graphs topologically as one-dimensional simplicial complexes, the simply connected infinte tree is the universal cover of the Cayley graph; and the kernel of the mapping is the fundamental group of the Cayley graph.
Part of a Cayley graph of the Heisenberg group. (The coloring is only for visual aid.)
  • A Cayley graph of the discrete Heisenberg group [math]\displaystyle{ \left\{ \begin{pmatrix} 1 & x & z\\ 0 & 1 & y\\ 0 & 0 & 1\\ \end{pmatrix},\ x,y,z \in \Z\right\} }[/math] is depicted to the right. The generators used in the picture are the three matrices [math]\displaystyle{ X, Y, Z }[/math] given by the three permutations of 1, 0, 0 for the entries [math]\displaystyle{ x, y, z }[/math]. They satisfy the relations [math]\displaystyle{ Z = XYX^{-1}Y^{-1}, XZ = ZX, YZ = ZY }[/math], 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.[citation needed]
Cayley Q8 graph showing cycles of multiplication by quaternions i, j and k


The group [math]\displaystyle{ G }[/math] acts on itself by left multiplication (see Cayley's theorem). This may be viewed as the action of [math]\displaystyle{ G }[/math] on its Cayley graph. Explicitly, an element [math]\displaystyle{ h\in G }[/math] maps a vertex [math]\displaystyle{ g\in V(\Gamma) }[/math] to the vertex [math]\displaystyle{ hg\in V(\Gamma). }[/math] The set of edges of the Cayley graph and their color is preserved by this action: the edge [math]\displaystyle{ (g,gs) }[/math] is mapped to the edge [math]\displaystyle{ (hg,hgs) }[/math], both having color [math]\displaystyle{ c_s }[/math]. In fact, all automorphisms of the colored directed graph [math]\displaystyle{ \Gamma }[/math] are of this form, so that [math]\displaystyle{ G }[/math] is isomorphic to the symmetry group of [math]\displaystyle{ \Gamma }[/math].[note 1][note 2]

The left multiplication action of a group on itself is simply transitive, in particular, Cayley graphs are vertex-transitive. The following is a kind of converse to this:

Sabidussi's Theorem — An (unlabeled and uncolored) directed graph [math]\displaystyle{ \Gamma }[/math] is a Cayley graph of a group [math]\displaystyle{ G }[/math] if and only if it admits a simply transitive action of [math]\displaystyle{ G }[/math] by graph automorphisms (i.e., preserving the set of directed edges).[4]

To recover the group [math]\displaystyle{ G }[/math] and the generating set [math]\displaystyle{ S }[/math] from the unlabeled directed graph [math]\displaystyle{ \Gamma }[/math], select a vertex [math]\displaystyle{ v_1\in V(\Gamma) }[/math] and label it by the identity element of the group. Then label each vertex [math]\displaystyle{ v }[/math] of [math]\displaystyle{ \Gamma }[/math] by the unique element of [math]\displaystyle{ G }[/math] that maps [math]\displaystyle{ v_1 }[/math] to [math]\displaystyle{ v. }[/math] The set [math]\displaystyle{ S }[/math] of generators of [math]\displaystyle{ G }[/math] that yields [math]\displaystyle{ \Gamma }[/math] as the Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is the set of labels of out-neighbors of [math]\displaystyle{ v_1 }[/math]. Since [math]\displaystyle{ \Gamma }[/math] is uncolored, it might have more directed graph automorphisms than the left multiplication maps, for example group automorphisms of [math]\displaystyle{ G }[/math] which permute [math]\displaystyle{ S }[/math].

Elementary properties

  • The Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] depends in an essential way on the choice of the set [math]\displaystyle{ S }[/math] of generators. For example, if the generating set [math]\displaystyle{ S }[/math] has [math]\displaystyle{ k }[/math] elements then each vertex of the Cayley graph has [math]\displaystyle{ k }[/math] incoming and [math]\displaystyle{ k }[/math] outgoing directed edges. In the case of a symmetric generating set [math]\displaystyle{ S }[/math] with [math]\displaystyle{ r }[/math] elements, the Cayley graph is a regular directed graph of degree [math]\displaystyle{ r. }[/math]
  • Cycles (or closed walks) in the Cayley graph indicate relations among the elements of [math]\displaystyle{ S. }[/math] 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 [math]\displaystyle{ \mathcal{P} }[/math] is equivalent to solving the Word Problem for [math]\displaystyle{ \mathcal{P} }[/math].[1]
  • If [math]\displaystyle{ f: G'\to G }[/math] is a surjective group homomorphism and the images of the elements of the generating set [math]\displaystyle{ S' }[/math] for [math]\displaystyle{ G' }[/math] are distinct, then it induces a covering of graphs [math]\displaystyle{ \bar{f}: \Gamma(G',S')\to \Gamma(G,S), }[/math] where [math]\displaystyle{ S = f(S'). }[/math] In particular, if a group [math]\displaystyle{ G }[/math] has [math]\displaystyle{ k }[/math] generators, all of order different from 2, and the set [math]\displaystyle{ S }[/math] consists of these generators together with their inverses, then the Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is covered by the infinite regular tree of degree [math]\displaystyle{ 2k }[/math] corresponding to the free group on the same set of generators.
  • 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]
  • If [math]\displaystyle{ \rho_{\text{reg}}(g)(x) = gx }[/math] is the left-regular representation with [math]\displaystyle{ |G|\times |G| }[/math] matrix form denoted [math]\displaystyle{ [\rho_{\text{reg}}(g)] }[/math], the adjacency matrix of [math]\displaystyle{ \Gamma(G,S) }[/math] is [math]\displaystyle{ A = \sum_{s\in S} [\rho_{\text{reg}}(s)] }[/math].
  • Every group character [math]\displaystyle{ \chi }[/math] of the group [math]\displaystyle{ G }[/math] induces an eigenvector of the adjacency matrix of [math]\displaystyle{ \Gamma(G,S) }[/math]. The associated eigenvalue is [math]\displaystyle{ \lambda_\chi=\sum_{s\in S}\chi(s), }[/math] which, when [math]\displaystyle{ G }[/math] is Abelian, takes the form [math]\displaystyle{ \sum_{s\in S} e^{2\pi ijs/|G|} }[/math] for integers [math]\displaystyle{ j = 0,1,\dots,|G|-1. }[/math] In particular, the associated eigenvalue of the trivial character (the one sending every element to 1) is the degree of [math]\displaystyle{ \Gamma(G,S) }[/math], that is, the order of [math]\displaystyle{ S }[/math]. If [math]\displaystyle{ G }[/math] is an Abelian group, there are exactly [math]\displaystyle{ |G| }[/math] characters, determining all eigenvalues. The corresponding orthonormal basis of eigenvectors is given by [math]\displaystyle{ v_j = \tfrac{1}{\sqrt{|G|}}\begin{pmatrix} 1 & e^{2\pi ij/|G|} & e^{2\cdot 2\pi ij/|G|} & e^{3\cdot 2\pi ij/|G|} & \cdots & e^{(|G|-1)2\pi ij/|G|}\end{pmatrix}. }[/math] It is interesting to note that this eigenbasis is independent of the generating set [math]\displaystyle{ S }[/math].
    More generally for symmetric generating sets, take [math]\displaystyle{ \rho_1,\dots,\rho_k }[/math] a complete set of irreducible representations of [math]\displaystyle{ G, }[/math] and let [math]\displaystyle{ \rho_i(S) = \sum_{s\in S} \rho_i(s) }[/math] with eigenvalue set [math]\displaystyle{ \Lambda_i(S) }[/math]. Then the set of eigenvalues of [math]\displaystyle{ \Gamma(G,S) }[/math] is exactly [math]\displaystyle{ \bigcup_i \Lambda_i(S), }[/math] where eigenvalue [math]\displaystyle{ \lambda }[/math] appears with multiplicity [math]\displaystyle{ \dim(\rho_i) }[/math] for each occurrence of [math]\displaystyle{ \lambda }[/math] as an eigenvalue of [math]\displaystyle{ \rho_i(S). }[/math]

Schreier coset graph

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

Connection to group theory

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. Conversely, for symmetric generating sets, the spectral and representation theory of [math]\displaystyle{ \Gamma(G,S) }[/math] are directly tied together: take [math]\displaystyle{ \rho_1,\dots,\rho_k }[/math] a complete set of irreducible representations of [math]\displaystyle{ G, }[/math] and let [math]\displaystyle{ \rho_i(S) = \sum_{s \in S} \rho_i(s) }[/math] with eigenvalues [math]\displaystyle{ \Lambda_i(S) }[/math]. Then the set of eigenvalues of [math]\displaystyle{ \Gamma(G,S) }[/math] is exactly [math]\displaystyle{ \bigcup_i \Lambda_i(S), }[/math] where eigenvalue [math]\displaystyle{ \lambda }[/math] appears with multiplicity [math]\displaystyle{ \dim(\rho_i) }[/math] for each occurrence of [math]\displaystyle{ \lambda }[/math] as an eigenvalue of [math]\displaystyle{ \rho_i(S). }[/math]

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

Geometric group theory

For infinite groups, the coarse geometry of the Cayley graph is fundamental to geometric group theory. For a finitely generated group, this is independent of choice of finite set of generators, hence an intrinsic property of the group. This is only interesting for infinite groups: every finite group is coarsely equivalent to a point (or the trivial group), since one can choose as finite set of generators the entire group.

Formally, for a given choice of generators, one has the word metric (the natural distance on the Cayley graph), which determines a metric space. The coarse equivalence class of this space is an invariant of the group.

Expansion properties

When [math]\displaystyle{ S = S^{-1} }[/math], the Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is [math]\displaystyle{ |S| }[/math]-regular, so spectral techniques may be used to analyze the expansion properties of the graph. In particular for abelian groups, the eigenvalues of the Cayley graph are more easily computable and given by [math]\displaystyle{ \lambda_\chi = \sum_{s\in S} \chi(s) }[/math] with top eigenvalue equal to [math]\displaystyle{ |S| }[/math], so we may use Cheeger's inequality to bound the edge expansion ratio using the spectral gap.

Representation theory can be used to construct such expanding Cayley graphs, in the form of Kazhdan property (T). The following statement holds:[7]

If a discrete group [math]\displaystyle{ G }[/math] has Kazhdan's property (T), and [math]\displaystyle{ S }[/math] is a finite, symmetric generating set of [math]\displaystyle{ G }[/math], then there exists a constant [math]\displaystyle{ c \gt 0 }[/math] depending only on [math]\displaystyle{ G, S }[/math] such that for any finite quotient [math]\displaystyle{ Q }[/math] of [math]\displaystyle{ G }[/math] the Cayley graph of [math]\displaystyle{ Q }[/math] with respect to the image of [math]\displaystyle{ S }[/math] is a [math]\displaystyle{ c }[/math]-expander.

For example the group [math]\displaystyle{ G = \mathrm{SL}_3(\Z) }[/math] has property (T) and is generated by elementary matrices and this gives relatively explicit examples of expander graphs.

Integral classification

An integral graph is one whose eigenvalues are all integers. While the complete classification of integral graphs remains an open problem, the Cayley graphs of certain groups are always integral. Using previous characterizations of the spectrum of Cayley graphs, note that [math]\displaystyle{ \Gamma(G,S) }[/math] is integral iff the eigenvalues of [math]\displaystyle{ \rho(S) }[/math] are integral for every representation [math]\displaystyle{ \rho }[/math] of [math]\displaystyle{ G }[/math].

Cayley integral simple group

A group [math]\displaystyle{ G }[/math] is Cayley integral simple (CIS) if the connected Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is integral exactly when the symmetric generating set [math]\displaystyle{ S }[/math] is the complement of a subgroup of [math]\displaystyle{ G }[/math]. A result of Ahmady, Bell, and Mohar shows that all CIS groups are isomorphic to [math]\displaystyle{ \mathbb{Z}/p\mathbb{Z}, \mathbb{Z}/p^2\mathbb{Z} }[/math], or [math]\displaystyle{ \mathbb{Z}_2 \times \mathbb{Z}_2 }[/math] for primes [math]\displaystyle{ p }[/math].[8] It is important that [math]\displaystyle{ S }[/math] actually generates the entire group [math]\displaystyle{ G }[/math] in order for the Cayley graph to be connected. (If [math]\displaystyle{ S }[/math] does not generate [math]\displaystyle{ G }[/math], the Cayley graph may still be integral, but the complement of [math]\displaystyle{ S }[/math] is not necessarily a subgroup.)

In the example of [math]\displaystyle{ G=\mathbb{Z}/5\mathbb{Z} }[/math], the symmetric generating sets (up to graph isomorphism) are

  • [math]\displaystyle{ S = \{1,4\} }[/math]: [math]\displaystyle{ \Gamma(G,S) }[/math] is a [math]\displaystyle{ 5 }[/math]-cycle with eigenvalues [math]\displaystyle{ 2, \tfrac{\sqrt{5}-1}{2},\tfrac{\sqrt{5}-1}{2},\tfrac{-\sqrt{5}-1}{2},\tfrac{-\sqrt{5}-1}{2} }[/math]
  • [math]\displaystyle{ S = \{1,2,3,4\} }[/math]: [math]\displaystyle{ \Gamma(G,S) }[/math] is [math]\displaystyle{ K_5 }[/math] with eigenvalues [math]\displaystyle{ 4, -1,-1,-1,-1 }[/math]

The only subgroups of [math]\displaystyle{ \mathbb{Z}/5\mathbb{Z} }[/math] are the whole group and the trivial group, and the only symmetric generating set [math]\displaystyle{ S }[/math] that produces an integral graph is the complement of the trivial group. Therefore [math]\displaystyle{ \mathbb{Z}/5\mathbb{Z} }[/math] must be a CIS group.

The proof of the complete CIS classification uses the fact that every subgroup and homomorphic image of a CIS group is also a CIS group.[8]

Cayley integral group

A slightly different notion is that of a Cayley integral group [math]\displaystyle{ G }[/math], in which every symmetric subset [math]\displaystyle{ S }[/math] produces an integral graph [math]\displaystyle{ \Gamma(G,S) }[/math]. Note that [math]\displaystyle{ S }[/math] no longer has to generate the entire group.

The complete list of Cayley integral groups is given by [math]\displaystyle{ \mathbb{Z}_2^n\times \mathbb{Z}_3^m,\mathbb{Z}_2^n\times \mathbb{Z}_4^n, Q_8\times \mathbb{Z}_2^n,S_3 }[/math], and the dicyclic group of order [math]\displaystyle{ 12 }[/math], where [math]\displaystyle{ m,n\in \mathbb{Z}_{\ge 0} }[/math] and [math]\displaystyle{ Q_8 }[/math] is the quaternion group.[8] The proof relies on two important properties of Cayley integral groups:

  • Subgroups and homomorphic images of Cayley integral groups are also Cayley integral groups.
  • A group is Cayley integral iff every connected Cayley graph of the group is also integral.

Normal and Eulerian generating sets

Given a general group [math]\displaystyle{ G }[/math], a subset [math]\displaystyle{ S \subseteq G }[/math] is normal if [math]\displaystyle{ S }[/math] is closed under conjugation by elements of [math]\displaystyle{ G }[/math] (generalizing the notion of a normal subgroup), and [math]\displaystyle{ S }[/math] is Eulerian if for every [math]\displaystyle{ s \in S }[/math], the set of elements generating the cyclic group [math]\displaystyle{ \langle s \rangle }[/math] is also contained in [math]\displaystyle{ S }[/math]. A 2019 result by Guo, Lytkina, Mazurov, and Revin proves that the Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is integral for any Eulerian normal subset [math]\displaystyle{ S \subseteq G }[/math], using purely representation theoretic techniques.[9]

The proof of this result is relatively short: given [math]\displaystyle{ S }[/math] an Eulerian normal subset, select [math]\displaystyle{ x_1,\dots, x_t\in G }[/math] pairwise nonconjugate so that [math]\displaystyle{ S }[/math] is the union of the conjugacy classes [math]\displaystyle{ \operatorname{Cl}(x_i) }[/math]. Then using the characterization of the spectrum of a Cayley graph, one can show the eigenvalues of [math]\displaystyle{ \Gamma(G,S) }[/math] are given by [math]\displaystyle{ \left\{\lambda_\chi = \sum_{i=1}^t \frac{\chi(x_i) \left|\operatorname{Cl}(x_i)\right|}{\chi(1)}\right\} }[/math] taken over irreducible characters [math]\displaystyle{ \chi }[/math] of [math]\displaystyle{ G }[/math]. Each eigenvalue [math]\displaystyle{ \lambda_\chi }[/math] in this set must be an element of [math]\displaystyle{ \mathbb{Q}(\zeta) }[/math] for [math]\displaystyle{ \zeta }[/math] a primitive [math]\displaystyle{ m^{th} }[/math] root of unity (where [math]\displaystyle{ m }[/math] must be divisible by the orders of each [math]\displaystyle{ x_i }[/math]). Because the eigenvalues are algebraic integers, to show they are integral it suffices to show that they are rational, and it suffices to show [math]\displaystyle{ \lambda_\chi }[/math] is fixed under any automorphism [math]\displaystyle{ \sigma }[/math] of [math]\displaystyle{ \mathbb{Q}(\zeta) }[/math]. There must be some [math]\displaystyle{ k }[/math] relatively prime to [math]\displaystyle{ m }[/math] such that [math]\displaystyle{ \sigma(\chi(x_i)) = \chi(x_i^k) }[/math] for all [math]\displaystyle{ i }[/math], and because [math]\displaystyle{ S }[/math] is both Eulerian and normal, [math]\displaystyle{ \sigma(\chi(x_i)) = \chi(x_j) }[/math] for some [math]\displaystyle{ j }[/math]. Sending [math]\displaystyle{ x\mapsto x^k }[/math] bijects conjugacy classes, so [math]\displaystyle{ \operatorname{Cl}(x_i) }[/math] and [math]\displaystyle{ \operatorname{Cl}(x_j) }[/math] have the same size and [math]\displaystyle{ \sigma }[/math] merely permutes terms in the sum for [math]\displaystyle{ \lambda_\chi }[/math]. Therefore [math]\displaystyle{ \lambda_\chi }[/math] is fixed for all automorphisms of [math]\displaystyle{ \mathbb{Q}(\zeta) }[/math], so [math]\displaystyle{ \lambda_\chi }[/math] is rational and thus integral.

Consequently, if [math]\displaystyle{ G=A_n }[/math] is the alternating group and [math]\displaystyle{ S }[/math] is a set of permutations given by [math]\displaystyle{ \{ (12i)^{\pm 1} \} }[/math], then the Cayley graph [math]\displaystyle{ \Gamma(A_n,S) }[/math] is integral. (This solved a previously open problem from the Kourovka Notebook.) In addition when [math]\displaystyle{ G = S_n }[/math] is the symmetric group and [math]\displaystyle{ S }[/math] is either the set of all transpositions or the set of transpositions involving a particular element, the Cayley graph [math]\displaystyle{ \Gamma(G,S) }[/math] is also integral.


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.[10]

See also

  1. Proof: Let [math]\displaystyle{ \sigma : V(\Gamma) \to V(\Gamma) }[/math] be an arbitrary automorphism of the colored directed graph [math]\displaystyle{ \Gamma }[/math], and let [math]\displaystyle{ h = \sigma(e) }[/math] be the image of the identity. We show that [math]\displaystyle{ \sigma(g) = hg }[/math] for all [math]\displaystyle{ g\in V(\Gamma) }[/math], by induction on the edge-distance of [math]\displaystyle{ g }[/math] from [math]\displaystyle{ e }[/math]. Assume [math]\displaystyle{ \sigma(g) = hg }[/math]. The automorphism [math]\displaystyle{ \sigma }[/math] takes any [math]\displaystyle{ c_s }[/math]-colored edge [math]\displaystyle{ g\to gs }[/math] to another [math]\displaystyle{ c_s }[/math]-colored edge [math]\displaystyle{ \sigma(g)\to\sigma(gs) }[/math]. Hence [math]\displaystyle{ \sigma(gs) = \sigma(g)s = hgs }[/math], and the induction proceeds. Since [math]\displaystyle{ \Gamma }[/math] is connected, this shows [math]\displaystyle{ \sigma(g) = hg }[/math] for all [math]\displaystyle{ g\in V(\Gamma) }[/math].
  2. It is easy to modify [math]\displaystyle{ \Gamma }[/math] into a simple graph (uncolored, undirected) whose symmetry group is isomorphic to [math]\displaystyle{ G }[/math]: replace colored directed edges of [math]\displaystyle{ \Gamma }[/math] with appropriate trees corresponding to the colors.


  1. 1.0 1.1 Magnus, Wilhelm; Karrass, Abraham; Solitar, Donald (2004). Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Courier. ISBN 978-0-486-43830-6. 
  2. 2.0 2.1 Cayley, Arthur (1878). "Desiderata and suggestions: No. 2. The Theory of groups: graphical representation". American Journal of Mathematics 1 (2): 174–6. doi:10.2307/2369306.$c239465;view=1up;seq=194.  In his Collected Mathematical Papers 10: 403–405.
  3. Theron, Daniel Peter (1988), An extension of the concept of graphically regular representations, Ph.D. thesis, University of Wisconsin, Madison, p. 46 .
  4. Sabidussi, Gert (October 1958). "On a class of fixed-point-free graphs". Proceedings of the American Mathematical Society 9 (5): 800–4. doi:10.1090/s0002-9939-1958-0097068-7. 
  5. See Theorem 3.7 of Babai, László (1995). "27. Automorphism groups, isomorphism, reconstruction". in Graham, Ronald L.; Grötschel, Martin; Lovász, László. Handbook of Combinatorics. 1. Elsevier. pp. 1447–1540. ISBN 9780444823465. 
  6. White, Arthur T. (1972). "On the genus of a group". Transactions of the American Mathematical Society 173: 203–214. doi:10.1090/S0002-9947-1972-0317980-2. 
  7. Proposition 1.12 in Lubotzky, Alexander (2012). "Expander graphs in pure and applied mathematics". Bulletin of the American Mathematical Society 49: 113–162. doi:10.1090/S0273-0979-2011-01359-3. 
  8. 8.0 8.1 8.2 Ahmady, Azhvan; Bell, Jason; Mohar, Bojan (2014). "Integral Cayley graphs and groups". SIAM Journal on Discrete Mathematics 28 (2): 685–701. doi:10.1137/130925487. 
  9. Guo, W.; Lytkina, D.V.; Mazurov, V.D.; Revin, D.O. (2019). "Integral Cayley graphs". Algebra and Logic 58 (4): 297–305. doi:10.1007/s10469-019-09550-2. 
  10. Dehn, Max (2012). Papers on Group Theory and Topology. Springer-Verlag. ISBN 978-1461291077.  Translated from the German and with introductions and an appendix by John Stillwell, and with an appendix by Otto Schreier.

External links