Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-28T14:23:14.535Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphisms in switching classes of graphs

Published online by Cambridge University Press:  09 April 2009

David Harries  and
Hans Liebeck
Hans Liebeck
Affiliation:
Department of Mathematics University of KeeleKeele, Staffs. ST5 5BG England
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 investigate conditions on a permutation group G sufficient to ensure that G fixes a graph in any switching class of graphs that it stabilizes. Our main result gives a necessary and sufficient condition for a dihedral group G to have this property.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 26 , Issue 4 , December 1978 , pp. 475 - 486
Copyright
Copyright © Australian Mathematical Society 1978

References

Mallows, C. L. and Sloane, N. J. A. (1975), ‘Two-graphs, switching classes and Euler graphs are equal in number’, SIAM J. Appl. Math. 28, 87–880.CrossRefGoogle Scholar
Seidel, J. J. (1976), ‘A survey of two-graphs’, Proc. Intern. Coll. Teorie Combinatorie, Accad. Naz. Lincei, Roma, pp. 480–511.Google Scholar