Abstract
Let Γ be a connected regular bipartite graph of order 18p, where p is a prime. Assume that Γ admits a group acting primitively on one of the bipartition subsets of Γ. Then, in this paper, it is shown that either Γ is arc-transitive, or Γ is isomorphic to one of 17 semisymmetric graphs which are constructed from primitive groups of degree 9p.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
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
Brouwer A E, Cohen A M, Neumaier A. Distance-Regular Graphs. Berlin-Heidelberg: Springer-Verlag, 1989
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
Du S F, Marušič D. Biprimitive graphs of smallest order. J Algebraic Combin, 1999, 9: 151–156
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
Han H, Lu Z P. Semisymmetric graphs of order 6p 2 and prime valency. Sci China Math, 2012, 55: 2579–2592
Han H, Lu Z P. Affine primitive permutation groups and semisymmetric graphs. Electronic J Combin, 2013, 20: Paper 39, 9pp
Huppert H. Endliche Gruppen I. Berlin: Springer-Verlag, 1967
Iofinova M E, Ivanov A A. Biprimitive cubic graphs (in Russian). In: Investigation in Algebraic Theory of Combinatorial Objects. Moscow: Institute for System Studies, 1985, 124–134
Ivanov A V. 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
Li H L, Wang J, Wang L Y, et al. Vertex primitive graphs of order containing a large prime factor. Comm Algebra, 1994, 22: 3449–3477
Liebeck M, Saxl J. Primitive permutation groups containing an element of large prime order. J London Math Soc, 1985, 31: 237–249
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
Malnič A, Marušič D, Potočnik P, et al. An infinite family of Cubic edge-but not vertex-transitive graphs. Discrete Math, 2002, 280: 133–148
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, Xu M Y. Symmetric graphs of order a product of two distinct primes. J Combin Theory Ser B, 1993, 59: 245–266
Wang L, Du S F, Li X W. A class of semisymmetric graphs. Ars Math Contemp, 2014, 7: 40–53
Wilson R, Walsh P, et al. Atlas of Finite Group Representation. http://brauer.maths.qmul.ac.uk/Atlas/v3
Wilson S. A worthy family of semisymmetric graphs. Discrete Math, 2003, 271: 283–294
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Han, H., Lu, Z. Semisymmetric graphs admitting primitive groups of degree 9p . Sci. China Math. 58, 2671–2682 (2015). https://doi.org/10.1007/s11425-015-5022-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-015-5022-4