Vipul: Created page with "{{undirected graph family}} ==Definition== Let $n$ be a natural number that is at least 3. The '''dihedral graph''' on $2n$ vertices is defined in the ..."

2012-05-29T17:04:35Z

Created page with "{{undirected graph family}} ==Definition== Let <math>n</math> be a natural number that is at least 3. The '''dihedral graph''' on <math>2n</math> vertices is defined in the ..."

New page

{{undirected graph family}}

==Definition==

Let <math>n</math> be a natural number that is at least 3. The '''dihedral graph''' on <math>2n</math> vertices is defined in the following equivalent ways:

# It is the [[prism of a graph|prism]] of the [[cycle graph]] on <math>n</math> vertices
# It is the [[Cayley graph]] of the [[groupprops:dihedral group]] of degree <math>n</math> (order <math>2n</math>) where we take the generating set as follows: a generator of the cyclic subgroup of index two (and its inverse) and an element of order two outside the subgroup.

Dihedral graph - Revision history

Vipul: Created page with "{{undirected graph family}} ==Definition== Let n be a natural number that is at least 3. The '''dihedral graph''' on 2n vertices is defined in the ..."

Vipul: Created page with "{{undirected graph family}} ==Definition== Let $n$ be a natural number that is at least 3. The '''dihedral graph''' on $2n$ vertices is defined in the ..."