Semiregular automorphisms of edge-transitive graphs

被引：6

作者：

Giudici, Michael ^{[1
]}

Potocnik, Primoz ^{[2
,3
]}

Verret, Gabriel ^{[1
,4
]}

机构：

[1] Univ Western Australia, Sch Math & Stat, Ctr Math Symmetry & Computat, Crawley, WA 6009, Australia

[2] Univ Ljubljana, Fac Math & Phys, SI-1000 Ljubljana, Slovenia

[3] Univ Primorska, IAM, SI-6000 Koper, Slovenia

[4] Univ Primorska, FAMNIT, SI-6000 Koper, Slovenia

来源：

JOURNAL OF ALGEBRAIC COMBINATORICS | 2014年 / 40卷 / 04期

基金：

澳大利亚研究理事会;

关键词：

Edge-transitive graphs; Semiregular automorphism; Polycirculant conjecture; CONFIGURATIONS; DIGRAPHS;

D O I：

10.1007/s10801-014-0515-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial 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.

引用

页码：961 / 972

页数：12

共 18 条

[1] LIFTING HAMILTON CYCLES OF QUOTIENT GRAPHS [J].