Abstract
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p k (k≥1), and let A be the full automorphism group of X. In this paper, we prove that the stabilizer A v of a vertex v in A is a 2-group if p ≠ 5, or a {2,3}-group if p = 5. Furthermore, if p = 5 |A v | is not divisible by 32. As a result, we show that any 4-valent connected vertex-transitive graph with odd-prime-power order p k (k≥1) is at most 1-arc-transitive for p ≠ 5 and 2-arc-transitive for p = 5.
Similar content being viewed by others
References
Baik, Y.Q., Feng, Y.Q., Sim, H.S., Xu, M.Y. On the normality of Cayley graphs of abelian groups. Algebra Colloq., 5(3): 297–304 (1998)
Biggs, N. Algebraic graph theory (Second edition). Cambridge University Press, Cambridge, 1993
Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilso, R.A. Atlas of finite groups. Oxford University Press, Oxford, 1985
Gorenstein, D. Finite simple groups. Plenum Press, New York, 1982
Harary, F. Graph theory. Addison-Wesley, Reading, MA, 1969
Huppert, B. Endliche gruppen I. Springer-Verlag, Berlin, 1967
Tutte, W.T. On the symmetry of cubic graphs. Canad. J. Math., 11: 621–624 (1959)
Wielandt, H. Finite permutation groups. Academic Press, New York, 1964
Xu, M.Y. Automorphism groups and isomorphisms of Cayley digraphs. Discrete Math., 182: 309–319 (1998)
Xu, M.Y. Half-transitive graphs of prime-power order. J. Algebraic Combinatorics, 1: 275–282 (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the NNSFC (No. 19831050), RFDP (No. 97000141), SRF for ROCS, EYTP in China and Com2MaC-KOSEF in Korea.
Rights and permissions
About this article
Cite this article
Feng, Yq., Kwak, J. & Xu, My. On the Stabilizer of the Automorphism Group of a 4-valent Vertex-transitive Graph with Odd-prime-power Order. Acta Mathematicae Applicatae Sinica, English Series 19, 83–86 (2003). https://doi.org/10.1007/s10255-003-0083-5
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10255-003-0083-5