• nauty

• Referenced in 434 articles [sw00611]
• NAUTY: nauty is a program for computing automorphism groups of graphs and digraphs...
• GRAPE

• Referenced in 74 articles [sw07516]
• language, except for the automorphism group and isomorphism testing functions, which use Brendan McKay...
• LMFDB

• Referenced in 27 articles [sw07249]
• characters, as well as more generally from automorphic forms, algebraic varieties, and Artin representations...
• MOLGEN

• Referenced in 25 articles [sw00586]
• methods for colouring orbits and determining automorphism groups are presented in order to construct...
• DISCRETA

• Referenced in 25 articles [sw05937]
• program to constructt-designs with prescribed automorphism groups. Computer algebra system...
• CAS

• Referenced in 21 articles [sw07634]
• Galois conjugate; using an outer automorphism; powering, tensoring, inducing, extending; extracting irreducible components (using several...
• simpcomp

• Referenced in 19 articles [sw06898]
• vectors, the face lattice, the automorphism group, (co-)homology with explicit basis computation, intersection form...
• Q-extension

• Referenced in 15 articles [sw11094]
• used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices...
• Gpd

• Referenced in 8 articles [sw08651]
• recent work includes the implementation of automorphisms of a finite, connected groupoid: by permutation ... objects; by automorphism of the root group; and by choice of rays to each object ... automorphism group of such a groupoid is also computed, together with an isomorphism...
• Groups & Graphs

• Referenced in 7 articles [sw15344]
• projective configurations, polyhedra, convex hulls, combinatorial designs, automorphism groups, and fractals. Version...
• PermLib

• Referenced in 5 articles [sw09845]
• strong generating sets (BSGS). Additionally, it computes automorphisms of symmetric matrices and find the lexicographically...
• SymPol

• Referenced in 5 articles [sw09846]
• symmetric polyhedra. It helps to compute restricted automorphisms (parts of the linear symmetry group...
• AutPGrp

• Referenced in 2 articles [sw08640]
• package AutPGrp: Computing the Automorphism Group of a p-Group. The AutPGrp package introduces ... function to compute the automorphism group of a finite $p$-group. The underlying algorithm...
• Traces

• Referenced in 3 articles [sw07823]
• computing a canonical labeling and the automorphism group of a graph is investigated...
• nishe

• Referenced in 1 article [sw19166]
• algorithm used by nauty. We employ discovered automorphisms to ensure that a canonical labeling ... polynomial time for colored Miyazaki graphs. These automorphisms can be used to make better choices ... depending on partial knowledge of the full automorphism group. The proposed modifications are not specific ... Miyazaki graphs. Any graph with a nontrivial automorphism group can benefit from our approach...
• ModIsom

• Referenced in 1 article [sw08645]
• package ModIsom: Computing automorphisms and checking isomorphisms for modular group algebras of finite p-groups ... contains a method to determine the automorphism group and to test isomorphis of such algebras...
• bliss

• Referenced in 1 article [sw21797]
• bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs. bliss ... open source tool for computing automorphism groups and canonical forms of graphs. It has both...
• MONOiD

• Referenced in 1 article [sw08361]
• simple, inverse, or completely regular; computing the automorphism group of a transformation semigroup; homomorphisms...