-TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION

DOI10.1017/S1446788714000664zbMath1319.05061arXiv1203.6386OpenAlexW2319967356MaRDI QIDQ5500778

Pablo Spiga, Joy Morris

Publication date: 10 August 2015

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.6386

zbMATH Keywords

Cartesian decompositiontournamentwreath product2-distance transitive

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Group actions on combinatorial structures (05E18)

Related Items (1)

Inclusions of innately transitive groups into wreath products in product action with applications to 2-arc-transitive graphs

Cites Work

• Unnamed Item
• Finite primitive distance-transitive graphs
• The characterization of finite groups with abelian Sylow 2-subgroups
• The characterization of finite groups with dihedral Sylow 2-subgroups. I, II
• Distance Transitive Graphs and Finite Simple Groups
• Analysing finite locally 𝑠-arc transitive graphs
• Proofs of Some Theorems of W.A. Manning
• An algebraic characterization of finite symmetric tournaments
• Permutation Groups with Multiply Transitive Suborbits

This page was built for publication: -TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION