期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
One-regular Normal Cayley Graphs on Dihedral Groups of Valency 4 or 6 with Cyclic Vertex Stabilizer 被引量:5
1
作者 JinHoKWAK JuMokOH 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2006年第5期1305-1320,共16页
A graph G is one-regular if its automorphism group Aut(G) acts transitively and semiregularly on the arc set. A Cayley graph Cay(Г, S) is normal if Г is a normal subgroup of the full automorphism group of Cay(... A graph G is one-regular if its automorphism group Aut(G) acts transitively and semiregularly on the arc set. A Cayley graph Cay(Г, S) is normal if Г is a normal subgroup of the full automorphism group of Cay(Г, S). Xu, M. Y., Xu, J. (Southeast Asian Bulletin of Math., 25, 355-363 (2001)) classified one-regular Cayley graphs of valency at most 4 on finite abelian groups. Marusic, D., Pisanski, T. (Croat. Chemica Acta, 73, 969-981 (2000)) classified cubic one-regular Cayley graphs on a dihedral group, and all of such graphs turn out to be normal. In this paper, we classify the 4-valent one-regular normal Cayley graphs G on a dihedral group whose vertex stabilizers in Aut(G) are cyclic. A classification of the same kind of graphs of valency 6 is also discussed. 展开更多
关键词 one-regular graph Cayley graph dihedral group half-transitive graph
原文传递
Cubic one-regular graphs of order twice a square-free integer
2
作者 ZHOU JinXin FENG YanQuan 《Science China Mathematics》 SCIE 2008年第6期1093-1100,共8页
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 = 3 t p... 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 = 3 t p 1 p 2···p s ? 13, where t ? 1, s ? 1 and p i ’s are distinct primes such that 3| (p i ? 1). For such an integer n, there are 2 s?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. 展开更多
关键词 one-regular graph symmetric graph Cayley graph 05C25 20B25
原文传递
Semisymmetric Cubic Graphs as Regular Covers of K_(3,3)
3
作者 Chang Qun WANG Tie Sheng CHEN 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2008年第3期405-416,共12页
A regular graph X is called semisymmetric if it is edge-transitive but not vertex-transitive. For G ≤ AutX, we call a G-cover X semisymmetric if X is semisymmetric, and call a G-cover X one-regular if Aut X acts regu... A regular graph X is called semisymmetric if it is edge-transitive but not vertex-transitive. For G ≤ AutX, we call a G-cover X semisymmetric if X is semisymmetric, and call a G-cover X one-regular if Aut X acts regularly on its arc-set. In this paper, we give the sufficient and necessary conditions for the existence of one-regular or semisymmetric Zn-Covers of K3,3. Also, an infinite family of semisymmetric Zn×Zn-covers of K3,3 are constructed. 展开更多
关键词 semisymmetric graph symmetric graph covering graph one-regular graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部