Graphs, Codes, and Designs

The package GRAPE allows one to construct graphs (with or without using groups), to determine many invariants of graphs, to classify complete subgraphs with various properties, to determine automorphism groups of graphs, and to test graph isomorphism (the last two via an interface to B.D. McKay's nauty package). A special feature of this package is the use of (parts of) the automorphism group (and hence of permutation group methods) of a graph to reduce the amount of data needed for the description of the graph.

The package GUAVA can construct many classes of codes, derive invariants such as minimal distance and weight distribution and find their automorphism groups.

The package Design provides classification, partitioning, and study of block designs, including the determination of automorphism groups and the testing of isomorphism.