Generalized Petersen graph

Short description: Family of cubic graphs formed from regular and star polygons

The Dürer graph G(6, 2).

In graph theory, the generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced in 1950 by H. S. M. Coxeter and was given its name in 1969 by Mark Watkins.

Definition and notation

In Watkins' notation, G(n, k) is a graph with vertex set

[math]\displaystyle{ \{u_0, u_1, \ldots, u_{n-1}, v_0, v_1, \ldots, v_{n-1}\} }[/math]

and edge set

[math]\displaystyle{ \{u_iu_{i+1}, u_iv_i, v_iv_{i+k} \mid 0 \le i \le n-1 \} }[/math]

where subscripts are to be read modulo n and k < n/2. Some authors use the notation GPG(n, k). Coxeter's notation for the same graph would be {n} + {n/k}, a combination of the Schläfli symbols for the regular n-gon and star polygon from which the graph is formed. The Petersen graph itself is G(5, 2) or {5} + {5/2}.

Any generalized Petersen graph can also be constructed from a voltage graph with two vertices, two self-loops, and one other edge.

Examples

Among the generalized Petersen graphs are the n-prism G(n, 1), the Dürer graph G(6, 2), the Möbius-Kantor graph G(8, 3), the dodecahedron G(10, 2), the Desargues graph G(10, 3) and the Nauru graph G(12, 5).

Four generalized Petersen graphs – the 3-prism, the 5-prism, the Dürer graph, and G(7, 2) – are among the seven graphs that are cubic, 3-vertex-connected, and well-covered (meaning that all of their maximal independent sets have equal size).

Properties

One of the three Hamiltonian cycles in G(9, 2). The other two Hamiltonian cycles in the same graph are symmetric under 40° rotations of the drawing.

This family of graphs possesses a number of interesting properties. For example:

• G(n, k) is vertex-transitive (meaning that it has symmetries that take any vertex to any other vertex) if and only if (n, k) = (10, 2) or k² ≡ ±1 (mod n).
• G(n, k) is edge-transitive (having symmetries that take any edge to any other edge) only in the following seven cases: (n, k) = (4, 1), (5, 2), (8, 3), (10, 2), (10, 3), (12, 5), (24, 5). These seven graphs are therefore the only symmetric generalized Petersen graphs.
• G(n, k) is bipartite if and only if n is even and k is odd.
• G(n, k) is a Cayley graph if and only if k² ≡ 1 (mod n).
• G(n, k) is hypohamiltonian when n is congruent to 5 modulo 6 and k = 2, n − 2, or (n ± 1)/2 (these four choices of k lead to isomorphic graphs). It is also non-Hamiltonian when n is divisible by 4, at least equal to 8, and k = n/2. In all other cases it has a Hamiltonian cycle. When n is congruent to 3 modulo 6 G(n, 2) has exactly three Hamiltonian cycles. For G(n, 2), the number of Hamiltonian cycles can be computed by a formula that depends on the congruence class of n modulo 6 and involves the Fibonacci numbers.
• Every generalized Petersen graph is a unit distance graph.

Isomorphisms

G(n, k) is isomorphic to G(n, l) if and only if k=l or kl ≡ ±1 (mod n).

Girth

The girth of G(n, k) is at least 3 and at most 8, in particular:

[math]\displaystyle{ g(G(n,k)) \le \min \left \{8,k+3,\frac{n}{\gcd(n,k)} \right \}. }[/math]

A table with exact girth values:

Condition	Girth
[math]\displaystyle{ n=3k }[/math]	3
[math]\displaystyle{ n=4k }[/math]	4
[math]\displaystyle{ k=1 }[/math]
[math]\displaystyle{ n=5k }[/math]	5
[math]\displaystyle{ n=5k/2 }[/math]
[math]\displaystyle{ k=2 }[/math]
[math]\displaystyle{ n=6k }[/math]	6
[math]\displaystyle{ k=3 }[/math]
[math]\displaystyle{ n=2k+2 }[/math]
[math]\displaystyle{ n=7k }[/math]	7
[math]\displaystyle{ n=7k/2 }[/math]
[math]\displaystyle{ n=7k/3 }[/math]
[math]\displaystyle{ k=4 }[/math]
[math]\displaystyle{ n=2k+3 }[/math]
[math]\displaystyle{ n=3k\pm2 }[/math]
otherwise	8

Chromatic number and chromatic index

Being regular, according to Brooks' theorem their chromatic number can not be larger than their degree. Generalized Petersen graphs are cubic, so their chromatic number can be either 2 or 3. More exactly:

[math]\displaystyle{ \chi(G(n,k))= \begin{cases} 2 & 2 \mid n \land 2 \nmid k \\ 3 & 2 \nmid n \lor 2 \mid k \\ \end{cases} }[/math]

Where [math]\displaystyle{ \land }[/math] denotes the logical AND, while [math]\displaystyle{ \lor }[/math] the logical OR. For example, the chromatic number of [math]\displaystyle{ G(5,2) }[/math] is 3.

• 

  A 3-coloring of the Petersen graph or [math]\displaystyle{ G(5,2) }[/math]

• 

  A 2-coloring of the Desargues graph or [math]\displaystyle{ G(10,3) }[/math]

• 

  A 3-coloring of the Dürer graph or [math]\displaystyle{ G(6,2) }[/math]

Petersen graph, being a snark, has a chromatic index of 4. All other generalized Petersen graph has chromatic index 3.

The generalized Petersen graph G(9, 2) is one of the few graphs known to have only one 3-edge-coloring.

• 

  A 4-edge-coloring of the Petersen graph or [math]\displaystyle{ G(5,2) }[/math]

• 

  A 3-edge-coloring of the Dürer graph or [math]\displaystyle{ G(6,2) }[/math]

• 

  A 3-edge-coloring of the dodecahedron or [math]\displaystyle{ G(10,2) }[/math]

• 

  A 3-edge-coloring of the Desargues graph or [math]\displaystyle{ G(10,3) }[/math]

• 

  A 3-edge-coloring of the Nauru graph or [math]\displaystyle{ G(12,5) }[/math]

The Petersen graph itself is the only generalized Petersen graph that is not 3-edge-colorable.

Perfect Colorings

All admissible matrices of all perfect 2-colorings of the graphs G(n, 2) and G(n, 3) are enumerated.

Admissible matrices

	G(n, 2)	G(n, 3)
[math]\displaystyle{ \begin{bmatrix} 2 & 1 \\ 1 & 2 \end{bmatrix} }[/math]	All graphs	All graphs
[math]\displaystyle{ \begin{bmatrix} 2 & 1 \\ 2 & 1 \end{bmatrix} }[/math]	Just G(3m, 2)	No graphs
[math]\displaystyle{ \begin{bmatrix} 1 & 2 \\ 2 & 1 \end{bmatrix} }[/math]	No graphs	Just G(2m,3)
[math]\displaystyle{ \begin{bmatrix} 0 & 3 \\ 1 & 2 \end{bmatrix} }[/math]	No graphs	Just G(4m,3)
[math]\displaystyle{ \begin{bmatrix} 0 & 3 \\ 2 & 1 \end{bmatrix} }[/math]	Just G(5m,2)	Just G(5m,3)
[math]\displaystyle{ \begin{bmatrix} 0 & 3 \\ 3 & 0 \end{bmatrix} }[/math]	No graphs	Just G(2m,3)