Primitive half-transitive graphs constructed from the symmetric groups of prime degrees
From MaRDI portal
Publication:2642015
DOI10.1016/j.jctb.2007.01.003zbMath1121.05060OpenAlexW1985722225MaRDI QIDQ2642015
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.01.003
Related Items (4)
The edge-transitive tetravalent Cayley graphs of square-free order ⋮ There exists no tetravalent half-arc-transitive graph of order \(2p^{2}\) ⋮ An infinite family of half-arc-transitive graphs with universal reachability relation ⋮ A class of bipartite 2-path-transitive graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Half-transitive graphs of prime-cube order
- A classification of the maximal subgroups of the finite alternating and symmetric groups
- Vertex-primitive graphs of order a product of two distinct primes
- Recent developments in half-transitive graphs
- On half-transitive metacirculant graphs of prime-power order
- On primitive permutation groups with small suborbits and their orbital graphs.
- On the point stabilizers of transitive groups with non-self-paired suborbits of length 2
- A graph which is edge transitive but not arc transitive
- Finite Permutation Groups and Finite Simple Groups
- Vertex-primitive ½-arc-transitive graphs of smallest order
- Vertex and Edge Transitive, but not 1-Transitive, Graphs
- Endliche Gruppen I
This page was built for publication: Primitive half-transitive graphs constructed from the symmetric groups of prime degrees