The classification of hamiltonian generalized Petersen graphs

https://doi.org/10.1016/0095-8956(83)90042-4Get rights and content
Under an Elsevier user license
open archive

Abstract

The generalized Petersen graph GP(n, k), n ≥ 2 and 1 ≤ kn − 1, has vertex-set {u0, u1,…, un − 1, v0, v1,…, vn − 1} and edge-set {uiui + 1, uivi, vivi + k : 0 ≤ in − 1 with subscripts reduced modulo n}. In this paper it is proved that GP(n, k) is hamiltonian if and only if it is neither GP(n, 2) ≅ GP(n, n − 2) ≅ GP(n, (n − 1)2GP(n, (n + 1)2) when n ≡ 5 (mod 6) nor GP(n, n2) when n ≡ 0 (mod 4) and n ≥ 8.

Cited by (0)

This research was partially supported by the Natural Science and Engineering Research Council of Canada through Grant A-4792.