Hostname: page-component-77c89778f8-m8s7h Total loading time: 0 Render date: 2024-07-18T20:20:17.732Z Has data issue: false hasContentIssue false
  • English
  • Français

On Sylow graphs

Published online by Cambridge University Press:  09 April 2009

D. A. Holton  and
J. Sheehan
D. A. Holton
Affiliation:
Department of Mathematics University of MelbourneParkville, Victoria 3052, Australia
J. Sheehan
Affiliation:
Department of Mathematics University of AberdeenAberdeen, Scotland
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We characterize the classes of graphs of order n whose automorphism group either contains or coincides with the 2-Sylow subgroup of the symmetric group Sn.

Subject classification (Amer. Math. Soc. (MOS) 1970): 05 C 25.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 28 , Issue 1 , August 1979 , pp. 27 - 38
Copyright
Copyright © Australian Mathematical Society 1979

References

Harary, F. (1971), Graph theory (Addison-Wesley, Reading, Mass.)Google Scholar
Hemminger, R. L. (1968), ‘The group of an X-join of graphs’, J. Combinatorial Theory 5, 404–418.CrossRefGoogle Scholar
Holton, D. A. and Grant, D. D. (1975), ‘Regular graphs and stability’, J. Austral. Math. Soc. Ser. A 20, 377–384.CrossRefGoogle Scholar
Sabidussi, G. (1959), ‘The composition of graphs’, Duke Math. J. 26, 693–696.CrossRefGoogle Scholar
Sabidussi, G. (1961), ‘Graph derivatives’, Math. Z. 76, 385–401.CrossRefGoogle Scholar