nauty ☆
« Back to VersTracker
Description:
Automorphism groups of graphs and digraphs
Type: Formula  |  Tracked Since: Dec 28, 2025
Links: Homepage  |  formulae.brew.sh
Category: Other
Tags: graph-theory combinatorics isomorphism algorithms mathematics
Install: brew install nauty
About:
Nauty (No AUTomorphisms, Yes?) is a set of algorithms for computing automorphism groups of graphs and digraphs. It provides highly optimized tools for graph isomorphism testing, canonical labeling, and group-theoretic computations. This software is essential for researchers and developers working with combinatorial structures.
Key Features:
  • Fast graph isomorphism testing and canonical labeling
  • Computes automorphism groups of graphs and digraphs
  • Handles large graphs with sparse structures (Traces)
  • Extensive library for graph generation and manipulation
Use Cases:
  • Research in algebraic graph theory and combinatorics
  • Chemical informatics for molecular structure analysis
  • Network analysis for identifying symmetrical structures
  • Generating unique identifiers for graph structures
Alternatives:
  • bliss – Bliss is another graph isomorphism solver, often compared for performance on specific graph types.
  • sageMath – SageMath is a larger mathematics system that includes graph isomorphism tools, but Nauty is a specialized, lightweight library.
Version History
Detected Version Rev Change Commit
Sep 16, 2025 5:14am 0 VERSION_BUMP 9f91dc32
Jan 13, 2024 6:41pm 0 VERSION_BUMP 39be26c2
« Back to VersTracker  |  Browse Packages  |  About