1. Introduction. For integers n and k with 2 ≤ 2k < n, the generalized Petersen graph G(n, k) has been defined in (8) to have vertex-set
![](//static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0305004100049811/resource/name/S0305004100049811_eqnU1.gif?pub-status=live)
and edge-set E(G(n, k)) to consist of all edges of the form
![](//static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0305004100049811/resource/name/S0305004100049811_eqn1.gif?pub-status=live)
where i is an integer. All subscripts in this paper are to be read modulo n, where the particular value of n will be clear from the context. Thus G(n, k) is always a trivalent graph of order 2n, and G(5, 2) is the well known Petersen graph. (The subclass of these graphs with n and k relatively prime was first considered by Coxeter ((2), p. 417ff.).)