Semiregular automorphisms of edge-transitive graphs

DOI10.1007/S10801-014-0515-8MaRDI QIDQ484161zbMATH OpenOpenAlexFDO

Authors Michael Giudici, Primož Potočnik, Gabriel Verret

Publication date 18 December 2014

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

edge-transitive graphspolycirculant conjecturesemiregular automorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.

Recommendations

• Semiregular automorphisms of arc-transitive graphs with valency \(pq\)
• Semiregular automorphisms of vertex-transitive graphs of certain valencies
• All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
• Semiregular automorphisms of cubic vertex transitive graphs
• Arc-transitive graphs of valency 8 have a semiregular automorphism

Cites work

• scientific article; zbMATH DE number 3918412 (Why is no real title available?)
• scientific article; zbMATH DE number 11983 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
• Arc-transitive graphs of valency 8 have a semiregular automorphism
• Distance-transitive graphs admit semiregular automorphisms
• Lifting Hamilton cycles of quotient graphs
• On vertex symmetric digraphs
• Permutation groups, vertex-transitive digraphs and semiregular automorphisms
• Polycyclic configurations
• Semiregular automorphisms of arc-transitive graphs with valency \(pq\)
• Semiregular automorphisms of vertex-transitive graphs of certain valencies
• Tetravalent edge-transitive graphs of girth at most 4
• The Magma algebra system. I: The user language
• Three Remarkable Graphs
• Weakly flag-transitive configurations and half-arc-transitive graphs

Cited in

(16)

• Elusive groups of automorphisms of digraphs of small valency
• \(r\)-regular families of graph automorphisms
• On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
• scientific article; zbMATH DE number 6930585 (Why is no real title available?)
• Semiregular automorphisms of vertex-transitive cubic graphs
• Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms
• All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
• Distance-transitive graphs admit semiregular automorphisms
• Semiregular automorphisms of arc-transitive graphs with valency \(pq\)
• Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
• Prime-valent symmetric graphs with a quasi-semiregular automorphism
• Semiregular automorphisms of vertex-transitive graphs of certain valencies
• Symmetries of the woolly hat graphs
• Edge-transitive products
• Arc-transitive graphs of valency 8 have a semiregular automorphism
• Semi-transitivity of directed split graphs generated by morphisms

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Semiregular automorphisms of edge-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484161)