Semiregular automorphisms of vertex-transitive cubic graphs

Peter Cameron; John Sheehan; Pablo Spiga

doi:10.1016/j.ejc.2005.04.008

Semiregular automorphisms of vertex-transitive cubic graphs

Peter Cameron^*
, John Sheehan
, Pablo Spiga

^*Corresponding author for this work

Centre for Interdisciplinary Research in Computational Algebra

Research output: Contribution to journal › Article › peer-review

Abstract

An old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.

Original language	English
Pages (from-to)	924-930
Number of pages	7
Journal	European Journal of Combinatorics
Volume	27
Issue number	6
DOIs	https://doi.org/10.1016/j.ejc.2005.04.008
Publication status	Published - 1 Aug 2006

Access to Document

10.1016/j.ejc.2005.04.008

Handle.net

Persistent link to portal record

Cite this

@article{a93aaac63a6d4045b8fcec52d7e8a341,

title = "Semiregular automorphisms of vertex-transitive cubic graphs",

abstract = "An old conjecture of Maru{\v s}i{\v c}, Jordan and Klin asserts that any finite vertex-transitive graph has a non-trivial semiregular automorphism. Maru{\v s}i{\v c} and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.",

author = "Peter Cameron and John Sheehan and Pablo Spiga",

year = "2006",

month = aug,

day = "1",

doi = "10.1016/j.ejc.2005.04.008",

language = "English",

volume = "27",

pages = "924--930",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press/Elsevier ",

number = "6",

}

TY - JOUR

T1 - Semiregular automorphisms of vertex-transitive cubic graphs

AU - Cameron, Peter

AU - Sheehan, John

AU - Spiga, Pablo

PY - 2006/8/1

Y1 - 2006/8/1

N2 - An old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.

AB - An old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.

U2 - 10.1016/j.ejc.2005.04.008

DO - 10.1016/j.ejc.2005.04.008

M3 - Article

AN - SCOPUS:33646108346

SN - 0195-6698

VL - 27

SP - 924

EP - 930

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 6

ER -

Semiregular automorphisms of vertex-transitive cubic graphs

Abstract

Access to Document

Handle.net

Fingerprint

Cite this