nauty

graph-theoretic program NAUTY: nauty is a program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. nauty is written in a portable subset of C, and runs on a considerable number of different systems. There is a small suite of programs called gtools included in the package. For example, geng can generate non-isomorphic graphs very quickly. There are also generators for bipartite graphs, digraphs, and multigraphs.

This software is also referenced in ORMS.


References in zbMATH (referenced in 529 articles , 1 standard article )

Showing results 1 to 20 of 529.
Sorted by year (citations)

1 2 3 ... 25 26 27 next

  1. Bernstein, Daniel Irving; Farnsworth, Cameron; Rodriguez, Jose Israel: The algebraic matroid of the finite unit norm tight frame (funtf) variety (2020)
  2. Chudnovsky, Maria; Goedgebeur, Jan; Schaudt, Oliver; Zhong, Mingxian: Obstructions for three-coloring graphs without induced paths on six vertices (2020)
  3. Danan, Eiran; Falcón, Raúl M.; Kotlar, Dani; Marbach, Trent G.; Stones, Rebecca J.: Refining invariants for computing autotopism groups of partial Latin rectangles (2020)
  4. Erskine, Grahame; Griggs, Terry; Širáň, Jozef: On the upper embedding of symmetric configurations with block size 3 (2020)
  5. Gebhardt, Volker; Tawn, Stephen: Constructing unlabelled lattices (2020)
  6. Ghorbani, Ebrahim; Kamali, Sara; Khosrovshahi, Gholamreza B.; Krotov, Denis: On the volumes and affine types of trades (2020)
  7. Goedgebeur, Jan; Meersman, Barbara; Zamfirescu, Carol T.: Graphs with few Hamiltonian cycles (2020)
  8. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2020)
  9. Krotov, Denis S.: On the OA(1536,13,2,7) and related orthogonal arrays (2020)
  10. Krotov, Denis S.; Vorob’ev, Konstantin V.: On unbalanced Boolean functions with best correlation immunity (2020)
  11. Abrosimov, Mikhaĭl Borisovich; Kamil, Ikhab AAbdzhuldzhabbar Kamil; Lobov, Aleksandr Andreevich: Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives (2019)
  12. Akgün, Özgür; Gent, Ian; Kitaev, Sergey; Zantema, Hans: Solving computational problems in the theory of word-representable graphs (2019)
  13. Aleš, Janez: Automorphism groups of Walecki tournaments with zero and odd signatures (2019)
  14. Araya, Makoto; Harada, Masaaki: On the classification of linear complementary dual codes (2019)
  15. Atserias, Albert; Mančinska, Laura; Roberson, David E.; Šámal, Robert; Severini, Simone; Varvitsiotis, Antonios: Quantum and non-signalling graph isomorphisms (2019)
  16. Bachmeier, Georg; Brandt, Felix; Geist, Christian; Harrenstein, Paul; Kardel, Keyvan; Peters, Dominik; Seedig, Hans Georg: (k)-majority digraphs and the hardness of voting with a constant number of voters (2019)
  17. Beaton, Iain; Brown, Jason I.; Cameron, Ben: Independence equivalence classes of paths and cycles (2019)
  18. Bohn, Adam; Faenza, Yuri; Fiorini, Samuel; Fisikopoulos, Vissarion; Macchia, Marco; Pashkovich, Kanstantsin: Enumeration of 2-level polytopes (2019)
  19. Brandt, Madeline; Dickinson, William; Ellsworth, AnnaVictoria; Kenkel, Jennifer; Smith, Hanson: Optimal packings of two to four equal circles on any flat torus (2019)
  20. Brouwer, Andries E.; Polak, Sven C.: Uniqueness of codes using semidefinite programming (2019)

1 2 3 ... 25 26 27 next