Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-26T11:40:20.308Z Has data issue: false hasContentIssue false
  • English
  • Français

The groups of the generalized Petersen graphs

Published online by Cambridge University Press:  24 October 2008

Roberto Frucht ,
Jack E. Graver  and
Mark E. Watkins
Roberto Frucht
Affiliation:
Universidad Tecnica Santa Maria, Valparaiso, Chile
Jack E. Graver
Affiliation:
Syracuse University, Syracuse, New York 13210
Mark E. Watkins
Affiliation:
Syracuse University, Syracuse, New York 13210
Get access Rights & Permissions [Opens in a new window]

Extract

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.).)

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 70 , Issue 2 , September 1971 , pp. 211 - 218
Copyright
Copyright © Cambridge Philosophical Society 1971

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Carmichael, R. D.Introduction to the theory of groups of finite order (Ginn, Boston, 1937).Google Scholar
(2)Coxeter, H. S. M.Self-dual configurations and regular graphs. Bull. Amer. Math. Soc. 56 (1950), 413–455.Google Scholar
(3)Coxeter, H. S. M. and Moser, W. O. J.Generators and relations for discrete groups, Springer's Ergeb. N.F. 14 (Berlin, 1965).Google Scholar
(4)Foster, Ronald M.Census of trivalent symmetrical graphs, I, presented at the Second Waterloo Combinational Conference,University of Waterloo,Waterloo, Ontario, in April, 1966.Google Scholar
(5)Frucht, Roberto.Die gruppe des Petersen'schen Graphen und der Kantensysteme der regulären Polyeder. Comment. Math. Helv. 9, (1936/1937), 217–223.CrossRefGoogle Scholar
(6)Tutte, W. T.A family of cubical graphs. Proc. Cambridge Philos. Soc. 43 (1947), 459–474.CrossRefGoogle Scholar
(7)Tutte, W. T.Connectivity in graphs (University of Toronto Press, Toronto, 1966).CrossRefGoogle Scholar
(8)Watkins, Mark E.A Theorem on Tait colorings with an application to the generalized Petersen graphs. J. Combinational Theory 6 (1969), 152–164.CrossRefGoogle Scholar