Automorphism groups of Cayley digraphs

被引:0
|
作者
Feng, Yan-Quan [1 ]
Lu, Zai-Ping [2 ]
Xu, Ming-Yo [3 ]
机构
[1] Beijing Jiaotong Univ, Math, Beijing, Peoples R China
[2] Nankai Univ, LPMC, Ctr Combinator, Tianjin, Peoples R China
[3] Peking Univ, Dept Math, Beijing, Peoples R China
关键词
Cayley digraph; normal Cayley digraph; arc-transitive graph; half-arc-transitive graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a group and S subset of G with 1 is not an element of S. A Cayley digraph Cay(G, S) on G with respect to S is the digraph with vertex set G such that, for x,y is an element of G, there is a directed edge from x to y whenever yx(-1) is an element of S. If S-1 = S, then Cay(G, S) can be viewed as an (undirected) graph by identifying two directed edges (x,y) and (y,x) with one edge {x,y}. Let X = Cay(G, S) be a Cayley digraph. Then every element g is an element of G induces naturally an automorphism R(g) of X by mapping each vertex x to xg. The Cayley digraph Cay(G, S) is said to be normal if R(G) = {R(gy)vertical bar g is an element of G} is a non-nal subgroup of the automorphism group of X. In this paper we shall give a brief survey of recent results on automorphism groups of Cayley digraphs concentrating on the normality of Cayley digraphs.
引用
收藏
页码:13 / +
页数:3
相关论文
共 50 条