Cayley graph of a group

From Groupprops
Revision as of 23:39, 31 March 2009 by Vipul (talk | contribs) (Created page with '==Definition== Let <math>G</math> be a group and <math>S</math> be a generating set for <math>G</math>. The '''Cayley graph''' of <math>G</math> with respect to <math>S</mat...')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

Let be a group and be a generating set for . The Cayley graph of with respect to is defined as follows:

  • The vertex set of the graph is .
  • Given two distinct vertices , there is an edge joining to if and only if is in .

We typically consider the Cayley graph for a finitely generated group and a finite generating set of the group. Further, we can assume without loss of generality that is a symmetric subset of -- the inverse of any element of is also in .