David Harries
Isomorphisms in switching classes of graphs
Harries, David
Authors
Abstract
We introduce notation and terminology to investigate conditions on a permutation group G sufficient to ensure that G fixes a graph in any switching class of graphs that it stabilises. We show that cyclic groups, groups of odd order groups of order ^k+2 and all stabilisers of switching classes of graphs on an odd number of vertices have this property.
In Chapter 5 we give a necessary and sufficient condition for a dihedral group to have this property.
In Chapter'6 we consider switching classes containing forests and graphs with a given girth g > 5. We give necessary and sufficient conditions for the stabilisers of all such switching classes to fix graphs in their classes.
Finally we give a brief account of the link between strong graphs and switching, and give an example of a class of switching classes with doubly transitive stabilisers.
Publicly Available Date | Mar 28, 2024 |
---|
Files
HarriesPhD1977.pdf
(2.3 Mb)
PDF
Downloadable Citations
About Keele Repository
Administrator e-mail: research.openaccess@keele.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search