G-graphs:: A new representation of groups

被引:13
作者
Bretto, Alain
Faisant, Alain
Gillibert, Luc
机构
[1] Univ Caen, CNRS, GREYC, UMR 6072, F-14032 Caen, France
[2] Univ St Etienne, LARAL, F-42023 St Etienne 2, France
关键词
computational group theory; graph representation of a group; Cayley graphs; G-graphs;
D O I
10.1016/j.jsc.2006.08.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An important part of computer science is focused on the links that can be established between group theory and graph theory and graphs. CAYLEY graphs, that establish such a link, are useful in a lot of areas of sciences. This paper introduces a new type of graph associated with a group, the G-graphs, and presents many of their properties. We show that various characteristics of a group can be seen on its associated G-graph. We also present an implementation of the algorithm constructing these new graphs, an implementation that will lead to some experimental results. Finally we show that many classical graphs are G-graphs. The relations between G-graphs and CAYLEY graphs are also studied. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:549 / 560
页数:12
相关论文
共 14 条
[1]  
[Anonymous], 1974, CAMBRIDGE TRACTS MAT
[2]  
Bretto A, 2004, LECT NOTES COMPUT SC, V3039, P343
[3]  
BRETTO A, 2004, 10 INT C APPL COMP A, P25
[4]  
CAYLEY A, 1889, AM J MATH, V11, P139
[5]  
Cayley A., 1878, Amer. J. Math, V1, P174
[6]  
COOPERMAN G, 1991, LECT NOTES COMPUT SC, V508, P367
[7]  
*GAP TEAM, 2002, GAP REF MAN REL 4 3
[8]  
HEYDEMANN MC, 1998, CAYLEY GRAPHS INTERC
[9]  
JONES GA, 2002, GRAPH GROUPS SURFACE, V2, P71
[10]   Constructing graphs with several pseudosimilar vertices or edges [J].
Lauri, J .
DISCRETE MATHEMATICS, 2003, 267 (1-3) :197-211