Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-20T16:32:02.012Z Has data issue: false hasContentIssue false
  • English
  • Français

$\wedge$-TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION

Part of: Permutation groups Algebraic combinatorics

Published online by Cambridge University Press:  31 March 2015

JOY MORRIS  and
PABLO SPIGA
JOY MORRIS*
Affiliation:
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada T1K 3M4 email [email protected]
PABLO SPIGA
Affiliation:
Dipartimento di Matematica Pura e Applicata, University of Milano-Bicocca, Via Cozzi 53, 20126 Milano, Italy email [email protected]
*
✉[email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be of considerable interest.

Keywords

2-distance transitivecartesian decompositionwreath producttournament

MSC classification

Primary: 20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
Secondary: 05E18: Group actions on combinatorial structures
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 99 , Issue 1 , August 2015 , pp. 85 - 107
Copyright
© 2015 Australian Mathematical Publishing Association Inc. 

References

Berggren, J. L., ‘An algebraic characterization of finite symmetric tournaments’, Bull. Aust. Math. Soc. 6 (1972), 53–59.CrossRefGoogle Scholar
Cameron, P. J., ‘Proofs of some theorems of W. A. Manning’, Bull. Lond. Math. Soc. 1 (1969), 349–352.CrossRefGoogle Scholar
Cameron, P. J., ‘Bounding the rank of certain permutation groups’, Math. Z. 124 (1972), 343–352.CrossRefGoogle Scholar
Cameron, P. J., ‘Permutation groups with multiply transitive suborbits’, Proc. Lond. Math. Soc. (3) 25 (1972), 427–440.CrossRefGoogle Scholar
Cameron, P. J., Permutation Groups, London Mathematical Society, Student Texts, 45 (Cambridge University Press, Cambridge, 1999).CrossRefGoogle Scholar
Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A. and Wilson, R. A., Atlas of Finite Groups (Clarendon Press, Oxford, 1985).Google Scholar
Dixon, J. D. and Mortimer, B., Permutation Groups, Graduate Texts in Mathematics, 163 (Springer, New York, 1996).CrossRefGoogle Scholar
Giudici, M., Li, C. H. and Praeger, C. E., ‘Analysing finite locally s-arc transitive graphs’, Trans. Amer. Math. Soc. 356 (2004), 291–317.CrossRefGoogle Scholar
Gorenstein, D. and Walter, J. H., ‘The characterization of finite groups with dihedral Sylow 2-subgroups’, J. Algebra 2 (1965), 85–151, 218–270, 354–393.CrossRefGoogle Scholar
Li, C. H. and Seress, Á., ‘Constructions of quasiprimitive two-arc-transitive graphs of product action type’, in: Finite Geometries, Groups, and Computation (Walter de Gruyter, Berlin, 2006), 115–123.CrossRefGoogle Scholar
Morris, J., Praeger, C. E. and Spiga, P., ‘Strongly regular edge-transitive graphs’, Ars Math. Contemp. 2 (2009), 137–155.CrossRefGoogle Scholar
Morris, J. and Spiga, P., ‘$2$-distance-transitive digraphs preserving a cartesian decomposition’, Preprint, 2012, arXiv:1203.6386v1.Google Scholar
Praeger, C. E., ‘Imprimitive symmetric graphs’, Ars Combin. 19A (1985), 149–163.Google Scholar
Praeger, C. E., Saxl, J. and Yokoyama, K., ‘Distance transitive graphs and finite simple groups’, Proc. Lond. Math. Soc. (3) 55 (1987), 1–21.CrossRefGoogle Scholar
Praeger, C. E. and Schneider, C., ‘Permutation groups and cartesian decompositions’, in preparation.Google Scholar
Suzuki, M., Group Theory II, Grundlehren der Mathematischen Wissenschaften, 248 (Springer, Berlin).CrossRefGoogle Scholar
van Bon, J., ‘Affine distance-transitive groups’, PhD Thesis, Universiteit Utrecht, 1990.Google Scholar
van Bon, J., ‘Finite primitive distance-transitive graphs’, European J. Combin. 28 (2007), 517–532.CrossRefGoogle Scholar
Walter, J. H., ‘The characterization of finite groups with Abelian Sylow 2-subgroups’, Ann. of Math. (2) 89 (1969), 405–514.CrossRefGoogle Scholar
Wielandt, H., Finite Permutation Groups (Academic Press, New York, 1964).Google Scholar