Distance-transitive graphs admit semiregular automorphisms
From MaRDI portal
Publication:1041179
DOI10.1016/j.ejc.2009.03.018zbMath1208.05049OpenAlexW2067736626MaRDI QIDQ1041179
Publication date: 1 December 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.018
Related Items (8)
Cubic arc-transitive \(k\)-multicirculants ⋮ Prime-valent symmetric graphs with a quasi-semiregular automorphism ⋮ Semiregular automorphisms of edge-transitive graphs ⋮ Symmetric graphs of valency 4 having a quasi-semiregular automorphism ⋮ Vertex-transitive generalized Cayley graphs which are not Cayley graphs ⋮ Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs ⋮ Transitive group actions: (im)primitivity and semiregular subgroups. ⋮ Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal normal subgroups of transitive permutation groups of square-free degree
- All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
- Semiregular automorphisms of vertex-transitive graphs of certain valencies
- Lifting Hamilton cycles of quotient graphs
- On vertex symmetric digraphs
- Permutation groups, vertex-transitive digraphs and semiregular automorphisms
- Semiregular automorphisms of vertex-transitive cubic graphs
- Transitive Permutation Groups Without Semiregular Subgroups
- Recent trends and future directions in vertex-transitive graphs
- QUASIPRIMITIVE GROUPS WITH NO FIXED POINT FREE ELEMENTS OF PRIME ORDER
- New Constructions of Groups Without Semiregular Subgroups
- On Trivalent Graphs
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- Research problems
This page was built for publication: Distance-transitive graphs admit semiregular automorphisms
