一类3m^2阶对称图的构造  

The Constructing of Symmetric Graphs of Order 3m^2

作　　者：高锐敏[1] 袁泽明[2] 李万军[1] 

机构地区：[1]河南牧业经济学院基础部,河南郑州450044 [2]河南财经政法大学计算机与信息工程学院,河南郑州450002

出　　处：《郑州大学学报（理学版）》2014年第2期39-42,共4页Journal of Zhengzhou University:Natural Science Edition

基　　金：河南省科技发展计划基础与前沿项目;编号142300410018

摘　　要：如果一个图的自同构群作用在它的弧集上是传递的,那么称这个图为对称图.定义了一类点传递但边不传递图,确定了其全自同构群,通过找覆盖图的方法得到了一类3m2(m>3,m为正整数)阶的对称图,该对称图实际上是交换群的Cayley图.A graph was said to be symmetric if its full automorphism group acted transitively on its arcs.An infinite family of vertex-but not edge-transitive graphs was defined,and the full automorphism groups of these graphs were determined.As a main result,by the method of getting covering graphs,an infinite family of symmetric graphs of order 3m2（m ＞ 3 and was positive integer） was constructed.In fact,these symmetric graphs were proved to be Cayley graphs of abelian groups.

关 键 词：边不传递图 覆盖图 对称图 

分 类 号：O157.5[理学—数学] O152.1[理学—基础数学]