The groups of the generalized Petersen graphs
Authors:
- 1 September 1971
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 70 (2) , 211-218
Abstract
1.Introduction. For integersnandkwith 2 ≤ 2k <n, thegeneralized Petersen graph G(n, k)has been defined in (8) to have vertex-set and edge-setE(G(n, k))to consist of all edges of the form whereiis an integer.All subscripts in this paper are to be read modulo n, where the particular value ofnwill be clear from the context. ThusG(n, k)is always a trivalent graph of order 2n, andG(5, 2) is the well known Petersen graph. (The subclass of these graphs withnandkrelatively prime was first considered by Coxeter ((2), p. 417ff.).)Keywords
This publication has 5 references indexed in Scilit:
- A theorem on tait colorings with an application to the generalized Petersen graphsJournal of Combinatorial Theory, 1969
- Connectivity in Graphs1966
- Self-dual configurations and regular graphsBulletin of the American Mathematical Society, 1950
- A family of cubical graphsMathematical Proceedings of the Cambridge Philosophical Society, 1947
- Die Gruppe des Petersenschen Graphen und der Kantensysteme der regul ren PolyederCommentarii Mathematici Helvetici, 1936