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 437 articles , 1 standard article )

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

1 2 3 ... 20 21 22 next

  1. Bach, Eric; Sandlund, Bryce: Baby-step giant-step algorithms for the symmetric group (2018)
  2. Monnig, Nathan D.; Meyer, François G.: The resistance perturbation distance: a metric for the analysis of dynamic networks (2018)
  3. Östergård, Patric R.J.; Soicher, Leonard H.: There is no McLaughlin geometry (2018)
  4. Szöllősi, Ferenc; Östergård, Patric R.J.: Enumeration of Seidel matrices (2018)
  5. Aguilar, Cesar O.; Gharesifard, Bahman: Almost equitable partitions and new necessary conditions for network controllability (2017)
  6. Berkholz, Christoph; Bonsma, Paul; Grohe, Martin: Tight lower and upper bounds for the complexity of canonical colour refinement (2017)
  7. Brandt, Felix; Harrenstein, Paul; Seedig, Hans Georg: Minimal extending sets in tournaments (2017)
  8. Brijder, Robert; Traldi, Lorenzo: Isotropic matroids. III: Connectivity (2017)
  9. Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub: Optimal-depth sorting networks (2017)
  10. Carballosa, Walter; Fabila-Monroy, Ruy; Leaños, Jesús; Rivera, Luis Manuel: Regularity and planarity of token graphs (2017)
  11. Foucart, Simon; Skrzypek, Lesław: On maximal relative projection constants (2017)
  12. Francetić, Nevena; Herke, Sarada; McKay, Brendan D.; Wanless, Ian M.: On Ryser’s conjecture for linear intersecting multipartite hypergraphs (2017)
  13. Kaplan, Nathan; Kimport, Susie; Lawrence, Rachel; Peilen, Luke; Weinreich, Max: Counting arcs in projective planes via Glynn’s algorithm (2017)
  14. Klin, Mikhail; Ziv-Av, Matan: A non-Schurian coherent configuration on 14 points exists (2017)
  15. Krotov, Denis S.: The extended 1-perfect trades in small hypercubes (2017)
  16. Lienkaemper, Caitlin; Shiu, Anne; Woodstock, Zev: Obstructions to convexity in neural codes (2017)
  17. Liu, Shunyi: On the bivariate permanent polynomials of graphs (2017)
  18. Machacek, John: Plurigraph coloring and scheduling problems (2017)
  19. Soicher, Leonard H.: The uniqueness of a distance-regular graph with intersection array $\32,27,8,1;1,4,27,32$ and related results$ (2017)
  20. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)

1 2 3 ... 20 21 22 next