The GAP package glabella provides a low level interface to software that can compute automorphisms, isomorphisms and canonical labellings of graphs. The graphs can be directed or undirected, and a vertex colouring can be specified. Duplicate edges between vertices are ignored.
These interfaces do not intend to be feature rich and user friendly. They are targeted to experienced GAP users and package authors, who can use them for their specific classes of graphs and other discrete mathematical structures, without the neccessity of compiling C and C++ codes.
For more specialized algorithms and methods of the theory of graphs, we recommend the packages Digraphs [DBJM+19] and GRAPE [Soi19].
In the present version of the package, we have access to the following solvers:
bliss: A Tool for Computing Automorphism Groups and Canonical Labellings of Graphs (version 0.73) written by Tommi Junttila and Petteri Kaski [JK07].
nauty and Traces: Graph Canonical Labelling and Automorphism Group Computation (version 2.7R1), written by Brendan McKay and Adolfo Piperno [MP14].
Download the package from https://nagygp.github.io/glabella/.
Unzip/untar the file, this should create a directory called glabella*.
Locate the pkg directory of your GAP directory, which contains the directories lib, doc and so on. Move the directory glabella* into the pkg directory.
Alternatively, you can use your pkg directory. Make sure it is in your GAP root path.
It is necessary to compile the glabella package. Inside the pkg/glabella* directory, type
./configure make
Start GAP in the usual way (i.e. type gap at the command line).
Type LoadPackage("glabella");
For questions, remarks and issues please use the issue tracker.
generated by GAPDoc2HTML