AGT

A GAP package

The AGT (algebraic graph theory) package [AGT] is a package available in GAP [GAP], which is still at an early stage of development. The official release version of the AGT package is available in the standard distribution of GAP.

The AGT package contains a methods used for the determination of various algebraic and regularity properties of graphs, as well as certain substructures of graphs. The package also contains a library of strongly regular graphs (35000+ graphs), intended to be a useful resource for computational experiments.

All of the functions in this package deal with finite simple graphs in GRAPE format [GRAPE]. Behind the scenes, we also use the Digraphs package [DIGRAPHS] to format and efficiently store and access the graphs in the strongly regular graph library.

Some of the functions I plan to add to the package soon are:

  • A large library of graph constructors. These will initially involve merging the gap-graphs package written by Janoš Vidali into the AGT package.
  • Further eigenvalue calculations for regular graphs.
  • Functions related to transitivity properties of graphs.
  • Functions related to codes in graphs.

References

2022

  1. GAP
    GAP – Groups, Algorithms, and Programming, Version 4.12.2
    The GAP Group
    2022
    HTML

2020

  1. GAP
    The AGT package for GAP, Version 0.2
    Rhys J. Evans
    2020
    HTML

2019

  1. GAP
    Digraphs – A GAP package, Version 0.15.3
    Jan De Beule, Julius Jonusas, James D. Mitchell, and 3 more authors
    2019
    Refereed GAP package
    HTML

2018

  1. GAP
    GRAPE, GRaph Algorithms using PErmutation groups, Version 4.8
    Leonard H. Soicher
    2018
    Refereed GAP package
    HTML