descriptionPublicationkeyboard_double_arrow_right Article , Preprint 28 Mar 2014Embargo end date: 01 Jan 2013 English Publisher:Springer Science and Business Media LLCJournal:Journal of Algebraic Combinatorics, volume 40, pages 961-972 (issn: 0925-9899, eissn: 1572-9192,

Authors: Gabriel Verret; Primož Potočnik; Michael Giudici;

doi: 10.1007/s10801-014-0515-8 , 10.48550/arxiv.1306.1971

arXiv: http://arxiv.org/abs/1306.1971

Semiregular automorphisms of edge-transitive graphs

- Summary
- Subjects
- Metrics

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.

Related Organizations

University of Ljubljana
Slovenia
University of Western Australia
Australia

Keywords

FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Group Theory (math.GR), Mathematics - Group Theory

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average