| 一类3m^2阶对称图的构造 |
| |
| 引用本文： | 高锐敏,袁泽明,李万军.一类3m^2阶对称图的构造[J].郑州大学学报(自然科学版),2014(2):39-42. |
| |
| 作者姓名： | 高锐敏 袁泽明 李万军 |
| |
| 作者单位： | [1]河南牧业经济学院基础部,河南郑州450044 [2]河南财经政法大学计算机与信息工程学院,河南郑州450002 |
| |
| 基金项目： | 河南省科技发展计划基础与前沿项目,编号142300410018. |
| |
| 摘 要： | 如果一个图的自同构群作用在它的弧集上是传递的,那么称这个图为对称图.定义了一类点传递但边不传递图,确定了其全自同构群,通过找覆盖图的方法得到了一类3m2（m＞3,m为正整数）阶的对称图,该对称图实际上是交换群的Cayley图.
|
| 关 键 词： | 边不传递图 覆盖图 对称图 |
The Constructing of Symmetric Graphs of Order 3m^2 |
| |
| GAO Rui-min,YUAN Ze-ming,LI Wan-jun.The Constructing of Symmetric Graphs of Order 3m^2[J].Journal of Zhengzhou University (Natural Science),2014(2):39-42. |
| |
| Authors: | GAO Rui-min YUAN Ze-ming LI Wan-jun |
| |
| Institution: | 1.Department of Basic Course,Henan University of Animal Husbandry and Economy,Zhengzhou 450044,China; 2.College of Computer and Information Engineering,Henan University of Economics and Law,Zhengzhou 450002,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | not edge-transitive graph covering graph symmetric graph |
| 本文献已被 维普 等数据库收录！ |
|
