Arc-transitive graphs of valency 8 have a semiregular automorphism
From MaRDI portal
Publication:5500487
Abstract: One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.
Recommendations
- Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
- Semiregular automorphisms of arc-transitive graphs with valency \(pq\)
- Semiregular automorphisms of edge-transitive graphs
- Semiregular automorphisms of vertex-transitive cubic graphs
- Semiregular automorphisms of vertex-transitive graphs of certain valencies
Cited in
(15)- On normality of n-Cayley graphs
- Semiregular automorphisms of arc-transitive graphs with valency \(pq\)
- Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms
- Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
- Cubic arc-transitive \(k\)-multicirculants
- Semiregular automorphisms of edge-transitive graphs
- Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method
- Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs
- Automorphisms of semitriangular graphs with \(\mu =8\)
- Locally 3-transitive graphs of girth 4
- Prime-valent symmetric graphs with a quasi-semiregular automorphism
- Polynomials of degree 4 over finite fields representing quadratic residues
- On certain edge-transitive bicirculants
- Symmetric graphs of valency 4 having a quasi-semiregular automorphism
- Semiregular automorphisms in vertex-transitive graphs of order \(3p^2\)
This page was built for publication: Arc-transitive graphs of valency 8 have a semiregular automorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500487)