×

zbMATH — the first resource for mathematics

Pentavalent 1-transitive digraphs with non-solvable automorphism groups. (English) Zbl 07344163
Summary: A digraph \(\overrightarrow{\Gamma}\) is said to be 1-transitive if its automorphism group acts transitively on the 1-arcs but not on the 2-arcs of \(\overrightarrow{\Gamma}\). We give a tentatively complete classification of pentavalent strongly connected 1-transitive digraphs of order \(2^ap^bq\), where \(p\) and \(q\) are two distinct odd primes, \(a\in\{3,\dots,8\}\), \(b\in\{1,\dots,4\}\), whose automorphism groups are non-solvable. It is shown that such digraphs exist if and only if \(q=3\) or 13 and \(p\in\{7,11, 17,19,31,41\}\).
MSC:
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
05C20 Directed graphs (digraphs), tournaments
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
Software:
Magma
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Alaeiyan, M.; Akbarizadeh, M., Classification of the pentavalent symmetric graphs of order 18p, Indian Journal of Pure and Applied Mathematics, 50, 2, 485-497 (2019) · Zbl 1429.05086
[2] Bosma, W.; Cannon, J.; Playoust, C., The Magma algebra system I: The user language, Journal of Symbolic Computation, 24, 3-4, 235-265 (1997) · Zbl 0898.68039
[3] Chen, Y. Q., On hamiltonicity of vertex-transitive graphs and digraphs of order p_4, Journal of Combinatorial Theory Series B, 72, 1, 110-121 (1998) · Zbl 0894.05038
[4] J. H. Conway, R. T. Curtis, and S. P. Norton, Atlas of finite groups: Maximal subgroups and ordinary characters for simple groups. · Zbl 0568.20001
[5] J. D. Dixon and B. Mortimer, Permutation groups, vol. 163, Springer Science & Business Media, 1996. · Zbl 0951.20001
[6] Guo, S-T; Zhou, J-X; Feng, Y-Q, Pentavalent symmetric graphs of order 12p, The Electronic, Journal of Combinatorics, 18, 1, 233 (2011)
[7] Hua, X-H; Feng, Y-Q; Lee, J., Pentavalent symmetric graphs of order 2pq, Discrete Mathematics, 311, 20, 2259-2267 (2011) · Zbl 1246.05072
[8] B. Huppert and W. Lempken, Simple groups of order divisible by at most four primes, IEM, 2000. · Zbl 1159.20303
[9] Ling, B., Classifying pentavalent symmetric graphs of order 24p, Bulletin of the Iranian Mathematical Society, 43, 6, 1855-1866 (2017) · Zbl 1405.05076
[10] Ling, B.; Wu, C. X.; Lou, B. G., Pentavalent symmetric graphs of order 30p, Bulletin of the Australian Mathematical Society, 90, 3, 353-362 (2014) · Zbl 1308.05061
[11] Pan, J.; Lou, B.; Liu, C., Arc-transitive pentavalent graphs of order 4pq, The Electronic Journal of Combinatorics, 20, 1, 36 (2013)
[12] Potocnik, P.; Bercic, K., Two-arc-transitive two-valent digraphs of certain orders, Ars Mathematica Contemporanea, 11, 1, 127-146 (2015) · Zbl 1351.05097
[13] P. Potocnik, P. Spiga, and G. Verret, A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two, arXiv preprint arXiv:1310.6543 (2013). · Zbl 1317.05191
[14] Potocnik, P.; Verret, G., On the vertex-stabiliser in arc-transitive digraphs, Journal of Combinatorial Theory, Series B, 100, 6, 497-509 (2010) · Zbl 1230.05141
[15] Praeger, C. E., Highly arc transitive digraphs, European Journal of Combinatorics, 10, 3, 281-292 (1989) · Zbl 0677.05041
[16] Yang, D-W; Feng, Y-Q; Du, J-L, Pentavalent symmetric graphs of order 2pqr, Discrete Mathematics, 339, 2, 522-532 (2016) · Zbl 1327.05149
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.