Cubic one-regular graphs of order twice a square-free integer

被引:0
作者
JinXin Zhou
YanQuan Feng
机构
[1] Beijing Jiaotong University,Department of Mathematics
来源
Science in China Series A: Mathematics | 2008年 / 51卷
关键词
one-regular graph; symmetric graph; Cayley graph; 05C25; 20B25;
D O I
暂无
中图分类号
学科分类号
摘要
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. Let n be a square-free integer. In this paper, we show that a cubic one-regular graph of order 2n exists if and only if n = 3tp1p2···ps ⩾ 13, where t ⩽ 1, s ⩾ 1 and pi’s are distinct primes such that 3| (pi − 1). For such an integer n, there are 2s−1 non-isomorphic cubic one-regular graphs of order 2n, which are all Cayley graphs on the dihedral group of order 2n. As a result, no cubic one-regular graphs of order 4 times an odd square-free integer exist.
引用
收藏
相关论文
共 42 条
  • [1] Malnič A.(1999)Constructing infinite one-regular graphs Europ J Combin 20 845-853
  • [2] Marušič D.(1997)A family of one-regular graphs of valency 4 Europ J Combin 18 59-64
  • [3] Seifter N.(1977)Automorphism groups of covering graphs J Combin Theory Ser B 71 67-72
  • [4] Marušič D.(2000)A note on one-regular graphs Chin Sci Bull 45 2160-2162
  • [5] Seifter N.(1952)A one-regular graph of degree three Canad J Math 4 240-247
  • [6] Xu M. Y.(1996)Remarks on path-transitivity in finite graphs Europ J Combin 17 371-378
  • [7] Frucht R.(1980)Regular groups of automorphisms of cubic graphs J Combin Theory Ser B 29 195-230
  • [8] Conder M. D. E.(1971)The trivalent symmetric graphs of girth at most six J Combin Theory Ser B 10 163-182
  • [9] Praeger C. E.(1997)A ½-transitive graph of valency 4 with nonsolvable group of automorphisms J Graph Theory 25 133-138
  • [10] Djoković D. Ž.(1994)Constructing graphs which are 1/2-transitive J Austral Math Soc A 56 391-402