Symmetric and semisymmetric graphs construction using G-graphs

Authors:
Alain Bretto;Luc Gillibert;Bernard Laget
Affiliations:
Université de Caen, GREYC CNRS UMR-6072, Campus II, Caen, France;Université de Caen, GREYC CNRS UMR-6072, Campus II, Caen, France;Ecole Nationale d'Ingénieurs de Saint-Etienne, DIPI, Saint-Etienne Cedex, France
Venue:
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Year:
2005

Citing 4
Cited 3

Group action graphs and parallel architectures

SIAM Journal on Computing
Cubic graphs

ACM Computing Surveys (CSUR)
Applications of Cayley Graphs

AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Constructing graphs with several pseudosimilar vertices or edges

Discrete Mathematics - Special issue: Combinatorics 2000

G-graphs for the cage problem: a new upper bound

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs

Discrete Applied Mathematics
A New Property of Hamming Graphs and Mesh of d-ary Trees

Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a huge usage of such graphs. Constructing symmetric and semisymmetric graphs is a large and hard problem. In this paper a tool called G-graphs and based on group theory is used. We show the efficiency of this tool for constructing symmetric and semisymmetric graphs and we exhibit experimental results.