|
Organizers |
Cubic Semisymmetric graphs of order 2p3
by
Aleksander Malnič
University of Ljubljana
Coauthors: Dragan Marušič (University of Ljubljana), Changqun Wang (Zhengzhou University)
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p >= 3 is a prime.
Date received: November 13, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafp-18.