Please note, due to essential maintenance online purchasing will be unavailable between 08:00 and 12:00 (BST) on 24th February 2019. We apologise for any inconvenience.
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
and edge-set E(G(n, k)) to consist of all edges of the form
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.).)
Email your librarian or administrator to recommend adding this journal to your organisation's collection.