On Criterion of Arc-Transitive Cayley Graphs
作者: 于 雪 ：云南大学数学与统计学院，云南 昆明;
Abstract: In 1938, R. Fruchet proved that for any given abstract group, there is a graph of it as an automorphism group. Since then, this area, which is about using the groups to study the graphs, opened the curtain. However, extensive research in this area began in 1960, especially in the last 30 years, where a number of important tasks were done. In this paper, we study a branch of graph theory that is, Cayley graph and its decision, especially the arc transitive graph. Firstly, by studying the properties of graph and the exchange of group, we get the main theorem of this paper. Secondly, according to the definition of the normal arc transitive graph and the pushing process of the main conclusion, a judgment condition of the normal arc transitive graph is given.
文章引用: 于 雪 (2017) 关于弧传递Cayley图的判定。 理论数学， 7， 277-281. doi: 10.12677/PM.2017.74036
 徐明曜. 有限群导引(下册)[M]. 北京: 科学出版社, 1999.3.
Li, C.H. (2006) Finite Edge-Transitive Cayley Graphs and Rotar Cayley Maps. Transactions of the American Mathematical Society, 358, 4605-4635.
Godsil, C.D. (1981) On the Full Automorphism Group of a Group. Combinatorial, 1, 243-256.