Article contents
Isomorphisms in switching classes of graphs
Published online by Cambridge University Press: 09 April 2009
Abstract
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
- 1
- Cited by