×

On edge-transitive cubic graphs of square-free order. (English) Zbl 1304.05026

Summary: A regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive. In this paper, we give a complete list of connected semisymmetric cubic graph of square-free order, which consists of one single graph of order 210 and four infinite families of such graphs.

MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
Full Text: DOI

References:

[1] Cameron, P. J.; Omidi, G. R.; Tayfeh-Rezaie, B., 3-design from \(PGL(2, q)\), Electron. J. Combin., 13, #R50 (2006) · Zbl 1097.05007
[2] Conder, M.; Dobcsányi, P., Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput., 40, 41-63 (2002) · Zbl 0996.05069
[3] Conder, M.; Malnič, A.; Marušič, D.; Potočnik, P., A census of semisymmetric cubic graphs on up to 768 vertices, J. Algebraic Combin., 23, 255-294 (2006) · Zbl 1089.05032
[4] Dixon, J. D.; Mortimer, B., Permutation Groups (1996), Springer: Springer New York · Zbl 0951.20001
[5] Du, S. F.; Xu, M. Y., A classification of semisymmetric graphs of order \(2 p q\), Comm. Algebra, 28, 2685-2714 (2000) · Zbl 0944.05051
[6] Feng, Y. Q.; Ghasemi, M.; Wang, C. Q., Cubic semisymmetric graphs of order \(6 p^3\), Discrete Math., 310, 2345-2355 (2010) · Zbl 1220.05058
[7] Folkman, J., Regular line-symmetric graphs, J. Combin. Theory Ser. B, 3, 215-232 (1967) · Zbl 0158.42501
[8] Giudici, M.; Li, C. H.; Praeger, C. E., Analysing finite locally \(s\)-arc transitive graphs, Trans. Amer. Math. Soc., 365, 291-317 (2004) · Zbl 1022.05033
[9] Goldschmidt, D. M., Automorphisms of trivalent graphs, Ann. of Math. (2), 111, 2, 377-406 (1980) · Zbl 0475.05043
[10] Han, H.; Lu, Z. P., Semisymmetric graphs of order \(6 p^2\) and prime valency, Sci. China Math., 55, 2579-2592 (2012) · Zbl 1257.05059
[11] Huppert, B., Endliche Gruppen I (1967), Springer-Verlag · Zbl 0217.07201
[12] Iofinova, M. E.; Ivanov, A. A., Biprimitive cubic graphs, (Investigation in Algebraic Theory of Combinatorial Objects. Investigation in Algebraic Theory of Combinatorial Objects, Proc. of the Seminar (1985), Institute for System Studies: Institute for System Studies Moscow), 124-134, Russian · Zbl 0706.05025
[13] Kleidman, P.; Liebeck, M., The Subgroup Structure of The Finite Classical Groups (1990), Cambridge University Press · Zbl 0697.20004
[14] Li, C. H.; Lu, Z. P.; Wang, G. X., Vertex-transitive cubic graphs of square-free order, J. Graph Theory, 75, 1-19 (2014) · Zbl 1280.05088
[15] Lipschutz, S.; Xu, M. Y., Note on infinite families of trivalent semisymmetric graphs, European J. Combin., 23, 6, 707-711 (2002) · Zbl 1014.05032
[16] Lu, Z. P.; Wang, C. Q.; Xu, M. Y., On semisymmetric cubic graphs of order \(6 p^2\), Sci. China Ser. A, 47, 1-17 (2004) · Zbl 1217.05107
[17] Malnič, A.; Marušič, D.; Potočnik, P.; Wang, C. Q., An infinite family of cubic edge-transitive but not vertex-transitive graphs, Discrete Math., 280, 133-148 (2004) · Zbl 1041.05039
[18] Parker, C. W., Semisymmetric cubic graphs of twice odd order, European J. Combin., 28, 572-591 (2007) · Zbl 1109.05054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.