Abstract
A graph Γ is called half-arc-transitive if it’s automorphism group Aut Γ is transitive on the vertex set and edge set, but not on the arc set of the graph Γ, and it is called 2-path-transitive if Aut Γ is transitive on the set of the 2-paths. In this paper we construct a class of 2-path-transitive graphs from some symmetric groups, based on which a new class of half-arc-transitive graphs is given.
Similar content being viewed by others
References
Conder M.D.E., Praeger C.E.: Remarks on path-transitivity in finite graphs. Eur. J. Combin. 17, 371–378 (1996)
Conway J.H., Curtis R.T., Norton S.P., Parker R.A., Wilson R.A.: Atlas of Finite Groups. Oxford University Press, London (1985)
Dixon J.D., Mortimer B.: Permutation Groups. Springer, New York (1996)
Guralnick R.M.: Subgroups of prime power index in a simple group. J. Algebra. 81, 304–311 (1983)
Li, C.H., Zhang, H.: On finite 2-path transitive graphs. J. Graph Theory (2013, to appear)
Li C.H., Zhang H.: Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs. J. Algebr. Combin. 36, 231–246 (2012)
Lu Z.P.: Primitive half-transitive graphs constructed from the symmetric groups of prime degrees. J. Combin. Theory Ser. B 97, 818–826 (2007)
Marušič D.: Recent developments in half-transitive graphs. Discrete Math. 182, 219–231 (1998)
Praeger C.E.: An O’Nan-Scott Theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J. Lond. Math. Soc. Ser. 2(47), 227–239 (1993)
Weiss R.M.: s-Arc transitive graphs. Algebr. Methods Graph Theory 2, 827–847 (1981)
Weiss R.M.: The nonexistence of 8-transitive graphs. Combinatorica 1, 309–311 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, H. A Class of Bipartite 2-Path-Transitive Graphs. Graphs and Combinatorics 30, 1319–1324 (2014). https://doi.org/10.1007/s00373-013-1345-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1345-5