- IJMC-1-2011-book
- Algo - ex2
- study guide
- 0408028v1
- International Journal of Mathematical Combinatorics, Vol. 1, 2011
- Solutions RMM2016 2
- Network Summary
- Ssl
- Imran F. Khan, Mehvish I. Poshni and Jonathan L. Gross- Genus distribution of graph amalgamations: Pasting when one root has arbitrary degree
- Waddle
- Saharon Shelah- Erdos and Renyi Conjecture
- Pseudoflow New Life for Lerchs-Grossmann
- 2004 Gori Icpr
- Cormen Algo-lec16
- megan lesson plan ce-2
- 39923
- 12 Network Statistics
- Outfit recommendation with consideration of user policy and preference on layered combination of garments
- MA2265 - Discrete Mathematics
- Chapter 6 the Traveling Salesman Problem
- Applications of Graph Theory in Computer Science an Overview
- Algorithmic Dominatio
- 1NWT_ Study Guide Review 15
- Thesis of Hipolito Hernandez.pdf
- Mca Science Oct2011
- Dynamic Slicing
- 2011+12MAT3CD+Sem+2+St+Hilda's+CA+(Solns)
- dsa ch6 tree
- IIIrd Sem Syllabus
- Ppsc Paper It
- Sapiens: A Brief History of Humankind
- The Unwinding: An Inner History of the New America
- Yes Please
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- Dispatches from Pluto: Lost and Found in the Mississippi Delta
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- John Adams
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America
- The Prize: The Epic Quest for Oil, Money & Power
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story
- This Changes Everything: Capitalism vs. The Climate
- Grand Pursuit: The Story of Economic Genius
- The Emperor of All Maladies: A Biography of Cancer
- Team of Rivals: The Political Genius of Abraham Lincoln
- The New Confessions of an Economic Hit Man
- Rise of ISIS: A Threat We Can't Ignore
- Smart People Should Build Things: How to Restore Our Culture of Achievement, Build a Path for Entrepreneurs, and Create New Jobs in America
- The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers
- The World Is Flat 3.0: A Brief History of the Twenty-first Century
- Bad Feminist: Essays
- How To Win Friends and Influence People
- Steve Jobs
- Angela's Ashes: A Memoir
- Leaving Berlin: A Novel
- The Silver Linings Playbook: A Novel
- The Sympathizer: A Novel (Pulitzer Prize for Fiction)
- Extremely Loud and Incredibly Close: A Novel
- The Light Between Oceans: A Novel
- The Incarnations: A Novel
- You Too Can Have a Body Like Mine: A Novel
- Life of Pi
- The Love Affairs of Nathaniel P.: A Novel
- The First Bad Man: A Novel
- We Are Not Ourselves: A Novel
- The Blazing World: A Novel
- The Rosie Project: A Novel
- The Flamethrowers: A Novel
- Brooklyn: A Novel
- A Man Called Ove: A Novel
- Bel Canto
- The Master
- Interpreter of Maladies
- Beautiful Ruins: A Novel
- The Kitchen House: A Novel
- Wolf Hall: A Novel
- The Art of Racing in the Rain: A Novel
- The Wallcreeper
- A Prayer for Owen Meany: A Novel
- The Cider House Rules
- The Perks of Being a Wallflower
- Lovers at the Chameleon Club, Paris 1932: A Novel
- The Bonfire of the Vanities: A Novel
- Little Bee: A Novel

ANDREW NICOL

**Cayley graphs give a way of encoding information about group in a graph. Given
**

a group with a, typically finite, generating set, we can form a Cayley Graph for

that group with respect to that generating set. Most of the information found here

is taken from John Meier’s, Groups Graphs and Trees, [1].

1. Cayley Graphs

Before we define Cayley graphs, we will give some basic definitions.

Definition 1. A graph, Γ, is a set of vertices and edges, where each edge e is

associated with a pair of vertices via the function “Ends”, where Ends(e) = {v, w}

for v, w not necessarily distinct vertices of Γ. Some examples can be seen in figure

1.

**Figure 1. Two examples of graphs.
**

A path is an ordered set of vertices and edges, {v0 , e1 , v1 , e2 , v2 , . . . , en , vn } such

that Ends(ek ) = {vk−1 , vk } for any integer k, 1 ≤ k ≤ n. A path without backtracking is a path such that ek 6= e−1

k+1 , that is, if an edge is in a path, the reverse

direction of that same edge does not immediately follow. A circuit is a path such

that v0 = vn . A tree is a graph where no paths without backtracking are circuits.

Given a graph Γ, a symmetry, α : Γ → Γ, is a bijection, sending vertices to

vertices and edges to edges, such that if Ends(e) = {v, w} for some edge e and

vertices v, w, then Ends(α(e)) = {α(v), α(w)}. The set of all symmetries of a

graph forms a group under the operation of composition.

Let us look back at figure 1 and determine the symmetry groups of the two

graphs. For the figure on the left, the top left vertex can either stay where it is or

switch places with the bottom left vertex. If the top left vertex is not moved, then

all of the vertices must remain fixed. If the top left and bottom left vertices are

interchanged, then the right vertices must also be switched, and what we get is a

reflection. This contributes a factor of Z2 to the symmetry group. Next, we can

1

2

ANDREW NICOL

**interchange the 3 edges on the left however we want. This contributes a factor of
**

S3 . Since reflecting the graph and interchanging the three edges on the left do not

affect each other, we get Sym(Γ) = Z2 ⊕ S3 .

Similarly, it is a good exercise to see why the symmetry group of the graph on

the right in figure 1 is Z2 ⊕ Z2 ⊕ S2 ⊕ S2 .

Meier presents the following two theorems and elaborates on the proofs:

Theorem 2 (Cayley’s Basic Theorem). Every group can be faithfully represented

as a group of permutations.

Proof. Consider the group SG .

**This theorem can be improved.
**

Theorem 3 (Cayley’s Better Theorem). Every finitely generated group can be

faithfully represented as a symmetry group of a connected, directed, locally finite

graph.

Here, locally finite means that for any vertex e, there are finitely many edges

v1 , . . . , vn with vk ∈ Ends(e).

Proof. Let G be a finitely generated group with generating set S = {s1 , . . . , sn }.

We prove this theorem by constructing a graph, ΓG,S on which G acts.

The vertices of ΓG,S will be the elements of G. For each g ∈ G, s ∈ S, make an

edge labeled s from the vertex labeled g to the vertex labeled gs. Since G is finitely

generated, this graph is locally finite. Since S generates G, this graph is connected.

By construction, G is directed. Let G act on the graph by left multiplication. That

is, for any g ∈ G, g will send the vertex labeled h to the vertex labeled gh. It is

easily verified that this graph satisfies the desired properties.

**Note that the Cayley graph for a group is not unique, since it depends on the
**

generating set. We now look at some examples to help illustrate this theorem.

**Figure 2. Two Cayley graphs for S3 . The Cayley graph on the
**

left is with respect to generating set S = {(12), (123)}, while the

Cayley graph on the right is with respect to generating set S 0 =

{(12), (23)}. This helps illustrate how the Cayley graph depends

on the generating set.

WHAT IS... A CAYLEY GRAPH?

3

**Figure 3. Another example of Cayley graphs. This time, we have
**

Cayley graphs for D4 with generating sets S = {r, s}, r a rotation

and s a symmetry, and S 0 = {a, b}, two adjacent reflections

Figure 4. This is the Cayley graph for S4 with respect to generating set S = {(12), (23), (34)}. This shows that the Cayley graph’s

complexity increases quickly with the complexity and size of the

group.

**Notice that generating elements of order 2 result in 2 edges directed in opposite
**

directions with the same label. In these cases it is convenient to connect the vertices

with a single undirected edge, as seen in the second graph in figure 3. Figure 4 has

no labels at all because it is just supposed to show how complicated the Cayley

graphs can be, even for relatively simple groups such as S4 . Figure 5 has just a

few lebels written. Hopefully the unwritten labels are clear and can be determined

easily.

We now present some results from Meier.

4

ANDREW NICOL

**Figure 5. This is the Cayley graph of F2 =< x, y| > with respect
**

to generators S = {x, y}. Each horizontal edge is directed to the

right labeled x, and each vertical edge is directed upwards, labeled

y. This Cayley graph is a tree.

Theorem 4. There is a finite index subgroup of F2 =< x, y| >, the free group with

two generators. This subgroup is a free group of rank 3.

Proof. Consider H, the subgroup of F2 consisting of all elements of even length,

H =< x2 , xy, xy −1 >.

**Finally, from Meier, some applications to show how studying graphs can help
**

give information about groups.

Theorem 5. A group G is free if and only if G acts freely on a tree.

Corollary 6 (Nielsen-Schreier Theorem). Every subgroup of a free group is free.

Proof. If G is a free group, then G will act freely on its Cayley graph. If H is

a subgroup of G, then H will also act freely on the Cayley graph for G. By the

previous theorem, H is free.

References

[1] J. Meier, Groups Graphs and Trees: An introduction to the Geometry of infinite groups,

Cambridge University Press, Cambridge, 2008.

- IJMC-1-2011-bookUploaded byscience2010
- Algo - ex2Uploaded byShai Deshe
- study guideUploaded byapi-292970084
- 0408028v1Uploaded byaadas asdasda
- International Journal of Mathematical Combinatorics, Vol. 1, 2011Uploaded byscience2010
- Solutions RMM2016 2Uploaded byMilan Buljan
- Network SummaryUploaded byctoom14
- SslUploaded byYuri Sagala
- Imran F. Khan, Mehvish I. Poshni and Jonathan L. Gross- Genus distribution of graph amalgamations: Pasting when one root has arbitrary degreeUploaded byNimsma
- WaddleUploaded byEpic Win
- Saharon Shelah- Erdos and Renyi ConjectureUploaded byKsmweo
- Pseudoflow New Life for Lerchs-GrossmannUploaded byEfrain Mosqueyra
- 2004 Gori IcprUploaded byMaz Har Ul
- Cormen Algo-lec16Uploaded bygeniusamit
- megan lesson plan ce-2Uploaded byapi-384661405
- 39923Uploaded byJuan Sebastian Palma Trocha
- 12 Network StatisticsUploaded bymorgoth12
- Outfit recommendation with consideration of user policy and preference on layered combination of garmentsUploaded byIJEC_Editor
- MA2265 - Discrete MathematicsUploaded bySharevrything
- Chapter 6 the Traveling Salesman ProblemUploaded bysoniyee
- Applications of Graph Theory in Computer Science an OverviewUploaded byAlemayehu Geremew
- Algorithmic DominatioUploaded byARUL KING
- 1NWT_ Study Guide Review 15Uploaded bypearl015
- Thesis of Hipolito Hernandez.pdfUploaded byEdward Alvarenga
- Mca Science Oct2011Uploaded byanand
- Dynamic SlicingUploaded byLatha Balasundaram
- 2011+12MAT3CD+Sem+2+St+Hilda's+CA+(Solns)Uploaded byFred
- dsa ch6 treeUploaded byapi-394738731
- IIIrd Sem SyllabusUploaded byKapil Mittal
- Ppsc Paper ItUploaded bytanishgooel