详细信息
文献类型:期刊文献
中文题名:一类3m^2阶对称图的构造
英文题名:The Constructing of Symmetric Graphs of Order 3m^2
作者:高锐敏[1];袁泽明[2];李万军[1]
第一作者:高锐敏
机构:[1]河南牧业经济学院基础部;[2]河南财经政法大学计算机与信息工程学院
第一机构:河南牧业经济学院基础部,河南郑州450044
年份:2014
期号:2
起止页码:39-42
中文期刊名:郑州大学学报:理学版
收录:CSTPCD;;北大核心:【北大核心2011】;
基金:河南省科技发展计划基础与前沿项目;编号142300410018
语种:中文
中文关键词:边不传递图;覆盖图;对称图
外文关键词:not edge-transitive graph; covering graph; symmetric graph
摘要:如果一个图的自同构群作用在它的弧集上是传递的,那么称这个图为对称图.定义了一类点传递但边不传递图,确定了其全自同构群,通过找覆盖图的方法得到了一类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.
参考文献:
正在载入数据...