Skip to main content
Log in

Semisymmetric graphs of order 6p 2 and prime valency

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we investigate semisymmetric graphs of order 6p 2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p 2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p 2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≠ 1 (mod 6) and Γ is isomorphic to one known graph.

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. Bouwer I Z. An edge but not vertex transitive cubic graphs. Canad Math Bull, 1968, 11: 533–535

    Article  MathSciNet  MATH  Google Scholar 

  2. Bouwer I Z. On edge but not vertex transitive graphs. J Combin Theory Ser B, 1972, 12: 32–40

    Article  MathSciNet  MATH  Google Scholar 

  3. Bretto A, Gillibert L. G-graphs: an efficient tool for constructing symmetric and semisymmetric graphs. Discrete Appl Math, 2008, 156: 2719–2739

    Article  MathSciNet  MATH  Google Scholar 

  4. Cameron P J. Permutation Groups. Cambridge: Cambridge University Press, 1999

    Book  MATH  Google Scholar 

  5. Conder M, Malnič A, Marušič D, et al. A census of semisymmetric cubic graphs on up to 768 vertices. J Algebraic Combin, 2006, 23: 255–294

    Article  MathSciNet  MATH  Google Scholar 

  6. Conway J H, Curtis R T, Norton S P, et al. Atlas of finite groups. Oxford: Clarendon Press, 1985

  7. Dixon J D, Mortimer B. Permutation Groups. New York: Springer-Verlag, 1996

    Book  MATH  Google Scholar 

  8. Dobson E, Witte D. Transitive permutation groups of prime-squared degree. J Algebraic Combin, 2002, 16: 43–69

    Article  MathSciNet  MATH  Google Scholar 

  9. Du S F, Marušič D. Biprimitive Graphs of Smallest Order. J Algebraic Combin, 1999, 9: 151–156

    Article  MathSciNet  MATH  Google Scholar 

  10. Du S F, Marušič D. An infinite family of biprimitive semisymmetric graphs. J Graph Theory, 1999, 32: 217–228

    Article  MathSciNet  MATH  Google Scholar 

  11. Du S F, Xu M Y. A classification of semisymmetric graphs of order 2pq. Comm Algebra, 2000, 28: 2685–2714

    Article  MathSciNet  MATH  Google Scholar 

  12. Feng Y Q, Ghasemi M, Wang C Q. Cubic semisymmetric graphs of order 6p 3. Discrete Math, 2010, 310: 2345–2355

    Article  MathSciNet  MATH  Google Scholar 

  13. Folkman J. Regular line-symmetric graphs. J Combin Theory Ser B, 1967, 3: 215–232

    Article  MathSciNet  MATH  Google Scholar 

  14. Giudici M, Li C H, Praeger C E. Analysing finite locally s-arc transitive graphs. Trans Amer Math Soc, 2004, 365: 291–317

    Article  MathSciNet  Google Scholar 

  15. Huppert H, Blackburn N. Finite Groups II. Berlin: Springer-Verlag, 1982

    Book  MATH  Google Scholar 

  16. Iofinova M E, Ivanov A A. Biprimitive cubic graphs. In: Faradzev I A, Ivanov A A, Klin M H, eds. Investigation in Algrbraic Theory of Combinatorial Objects. London: Kluwer Academic Publishers, 1994, 459–472

    Google Scholar 

  17. Ivanov A A. On edge but not vertex transitive regular graphs. Ann Discrete Math, 1987, 34: 273–286

    Google Scholar 

  18. Kleidman P, Liebeck M. The subgroup structure of the finite classical groups. Cambridge: Cambridge University Press, 1990

    Book  MATH  Google Scholar 

  19. Liebeck M, Saxl J. The primitive permutation groups of odd degree. J London Math soc, 1985, 31: 250–264

    Article  MathSciNet  MATH  Google Scholar 

  20. Lu Z P. On the automorphism groups of bi-Cayley graphs. Beijing Daxue Xuebao, 2003, 39: 1–5

    MATH  Google Scholar 

  21. Lu Z P, Wang C Q, Xu M Y. On semisymmetric cubic graphs of order 6p 2. Sci China Ser A, 2004, 47: 1–17

    Article  MathSciNet  MATH  Google Scholar 

  22. Lu Z P, Wang C Q, Xu M Y. Semisymmetric cubic graphs constructed from bi-Cayley graphs of An. Ars Combin, 2006, 80: 177–187

    MathSciNet  MATH  Google Scholar 

  23. Malnič A, Marušič D, Wang C Q. Cubic edge-transitive graphs of order 2p 3. Discrete Math, 2004, 274: 187–198

    Article  MathSciNet  MATH  Google Scholar 

  24. Marušič M, Potočnik P. Semisymmetry of generalized Folkman graphs. European J Combin, 2001, 22: 333–349

    Article  MathSciNet  MATH  Google Scholar 

  25. Monson B, Pisanski T, Schulte E, et al. Semisymmetric graphs from polytopes. J Combin Theory Ser A, 2007, 114: 421–435

    Article  MathSciNet  MATH  Google Scholar 

  26. Parker C W. Semisymmetric cubic graphs of twice odd order. European J Combin, 2007, 28: 572–591

    Article  MathSciNet  MATH  Google Scholar 

  27. Praeger C E. An O’Nan-Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J London Math Soc, 1992, 47: 227–239

    Article  MathSciNet  MATH  Google Scholar 

  28. Wang R J, Xu M Y. A classification of symmetric graphs of order 3p. J Combin Theory Ser B, 1993, 58: 197–216

    Article  MathSciNet  MATH  Google Scholar 

  29. Wielandt H. Finit permutation groups. New York: Academic Press, 1964

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ZaiPing Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, H., Lu, Z. Semisymmetric graphs of order 6p 2 and prime valency. Sci. China Math. 55, 2579–2592 (2012). https://doi.org/10.1007/s11425-012-4424-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-012-4424-9

Keywords

MSC(2010)

Navigation