Abstract
A graph X is called vertex-transitive, edge-transitive, or arc-transitive, if the automorphism group of X acts transitively on the set of vertices, edges, or arcs of X, respectively. X is said to be 1/2-transitive, if it is vertex-transitive, edge-transitive, but not arc-transitive.
In this paper we determine all 1/2-transitive graphs with 3p vertices, where p is an odd prime. (See Theorem 3.4.)
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alspach, B., Marušič, D., and Nowitz, L., “ Constructing graphs which are 1/2-transitive graphs”, J. Austral. Math. Soc. Ser. A, to appear.
Alspach, B. and Parsons, T.D., “A construction for vertex-transitive graphs,” Canad. J. Math. 34 (1982), 307–318.
Biggs, N., Algebraic Graph Theory, Cambridge University Press, 1974.
Cameron, P.J., “Finite permutation groups and finite simple groups,” Bull. London Math. Soc. 13 (1981), 1–22.
Chartrand, G. and Lesniak, L., Graphs & Digraphs, Wadsworth and Brooks/Cole, Monterey, 1979.
Huppert, B., Endliche Gruppen 1, Springer-Verlag, 1967.
Wang, R.J. and Xu, M.Y., “A classification of symmetric graphs of order 3p,” J. Combin. Theory Ser. B, 58 (1993), 197–216.
Wielandt, H., Finite Permutation Groups, Academic Press, New York, 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alspach, B., Xu, MY. 1/2-Transitive Graphs of Order 3p . Journal of Algebraic Combinatorics 3, 347–355 (1994). https://doi.org/10.1023/A:1022466626755
Issue Date:
DOI: https://doi.org/10.1023/A:1022466626755