Article contents
CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
Published online by Cambridge University Press: 01 April 2008
Abstract
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be a prime. It was shown by Folkman [J. Folkman, ‘Regular line-symmetric graphs’, J. Combin. Theory3 (1967), 215–232] that a regular edge-transitive graph of order 2p or 2p2 is necessarily vertex-transitive. In this paper an extension of his result in the case of cubic graphs is given. It is proved that every cubic edge-transitive graph of order 8p2 is vertex-transitive.
- Type
- Research Article
- Information
- Copyright
- Copyright © 2008 Australian Mathematical Society
References
- 6
- Cited by