期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
s-REGULAR DIHEDRAL COVERINGS OF THE COMPLETE GRAPH OF ORDER 4
1
作者 FENGYANQUAN J.H.KWAK 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2004年第1期57-64,共8页
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a... A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a classification of all s-regular cyclic coverings of the complete bipartite graph of order 6 was given in [8] for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. In this paper, the authors classify all s-regular dihedral coverings of the complete graph of order 4 for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. As a result, a new infinite family of cubic 1-regular graphs is constructed. 展开更多
关键词 s-regular graphs s-arc-transitive graphs Regular coverings
原文传递
On the Stabilizer of the Automorphism Group of a 4-valent Vertex-transitive Graph with Odd-prime-power Order
2
作者 Yan-quanFeng JinHoKwak Ming-yaoXu 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2003年第1期83-86,共4页
Abstract Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p^k (kS1), and let A be the full automorphism group of X. In this paper, we prove that the stabilizer Av of a vertex v in A is ... Abstract Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p^k (kS1), and let A be the full automorphism group of X. In this paper, we prove that the stabilizer Av of a vertex v in A is a 2-group if p p 5, or a {2,3}-group if p = 5. Furthermore, if p = 5 |Av| is not divisible by 3^2. As a result, we show that any 4-valent connected vertex-transitive graph with odd-prime-power order p^k (kS1) is at most 1-arc-transitive for p p 5 and 2-arc-transitive for p = 5. 展开更多
关键词 Keywords Cayley graphs s -arc-transitive VERTEX-TRANSITIVE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部