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.
Similar content being viewed by others
References
Bouwer I Z. An edge but not vertex transitive cubic graphs. Canad Math Bull, 1968, 11: 533–535
Bouwer I Z. On edge but not vertex transitive graphs. J Combin Theory Ser B, 1972, 12: 32–40
Bretto A, Gillibert L. G-graphs: an efficient tool for constructing symmetric and semisymmetric graphs. Discrete Appl Math, 2008, 156: 2719–2739
Cameron P J. Permutation Groups. Cambridge: Cambridge University Press, 1999
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
Conway J H, Curtis R T, Norton S P, et al. Atlas of finite groups. Oxford: Clarendon Press, 1985
Dixon J D, Mortimer B. Permutation Groups. New York: Springer-Verlag, 1996
Dobson E, Witte D. Transitive permutation groups of prime-squared degree. J Algebraic Combin, 2002, 16: 43–69
Du S F, Marušič D. Biprimitive Graphs of Smallest Order. J Algebraic Combin, 1999, 9: 151–156
Du S F, Marušič D. An infinite family of biprimitive semisymmetric graphs. J Graph Theory, 1999, 32: 217–228
Du S F, Xu M Y. A classification of semisymmetric graphs of order 2pq. Comm Algebra, 2000, 28: 2685–2714
Feng Y Q, Ghasemi M, Wang C Q. Cubic semisymmetric graphs of order 6p 3. Discrete Math, 2010, 310: 2345–2355
Folkman J. Regular line-symmetric graphs. J Combin Theory Ser B, 1967, 3: 215–232
Giudici M, Li C H, Praeger C E. Analysing finite locally s-arc transitive graphs. Trans Amer Math Soc, 2004, 365: 291–317
Huppert H, Blackburn N. Finite Groups II. Berlin: Springer-Verlag, 1982
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
Ivanov A A. On edge but not vertex transitive regular graphs. Ann Discrete Math, 1987, 34: 273–286
Kleidman P, Liebeck M. The subgroup structure of the finite classical groups. Cambridge: Cambridge University Press, 1990
Liebeck M, Saxl J. The primitive permutation groups of odd degree. J London Math soc, 1985, 31: 250–264
Lu Z P. On the automorphism groups of bi-Cayley graphs. Beijing Daxue Xuebao, 2003, 39: 1–5
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
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
Malnič A, Marušič D, Wang C Q. Cubic edge-transitive graphs of order 2p 3. Discrete Math, 2004, 274: 187–198
Marušič M, Potočnik P. Semisymmetry of generalized Folkman graphs. European J Combin, 2001, 22: 333–349
Monson B, Pisanski T, Schulte E, et al. Semisymmetric graphs from polytopes. J Combin Theory Ser A, 2007, 114: 421–435
Parker C W. Semisymmetric cubic graphs of twice odd order. European J Combin, 2007, 28: 572–591
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
Wang R J, Xu M Y. A classification of symmetric graphs of order 3p. J Combin Theory Ser B, 1993, 58: 197–216
Wielandt H. Finit permutation groups. New York: Academic Press, 1964
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-012-4424-9