Graphical and computational representation of groups

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An important part of the computer science is focused on the links that can be established between group theory and graph theory. CAYLEY graphs can establish such a link but meet some limitations. This paper introduces a new type of graph associated to a group: the G-graphs. We present an implementation of the algorithm constructing these new graphs. We establish a library of the most common G-graphs, using GAP and the SmallGroups library. We give some experimental results with GAP and we show that many classical graphs are G-graphs. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Bretto, A., & Gillibert, L. (2004). Graphical and computational representation of groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3039, 343–350. https://doi.org/10.1007/978-3-540-25944-2_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free