Skip to main content
Log in

A Class of Bipartite 2-Path-Transitive Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Conder M.D.E., Praeger C.E.: Remarks on path-transitivity in finite graphs. Eur. J. Combin. 17, 371–378 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Conway J.H., Curtis R.T., Norton S.P., Parker R.A., Wilson R.A.: Atlas of Finite Groups. Oxford University Press, London (1985)

    MATH  Google Scholar 

  3. Dixon J.D., Mortimer B.: Permutation Groups. Springer, New York (1996)

    Book  MATH  Google Scholar 

  4. Guralnick R.M.: Subgroups of prime power index in a simple group. J. Algebra. 81, 304–311 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Li, C.H., Zhang, H.: On finite 2-path transitive graphs. J. Graph Theory (2013, to appear)

  6. Li C.H., Zhang H.: Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs. J. Algebr. Combin. 36, 231–246 (2012)

    Article  Google Scholar 

  7. Lu Z.P.: Primitive half-transitive graphs constructed from the symmetric groups of prime degrees. J. Combin. Theory Ser. B 97, 818–826 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Marušič D.: Recent developments in half-transitive graphs. Discrete Math. 182, 219–231 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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)

    Article  MathSciNet  Google Scholar 

  10. Weiss R.M.: s-Arc transitive graphs. Algebr. Methods Graph Theory 2, 827–847 (1981)

    Google Scholar 

  11. Weiss R.M.: The nonexistence of 8-transitive graphs. Combinatorica 1, 309–311 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hua Zhang.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1345-5

Keywords

Navigation