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

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

1 2 3 ... 21 22 23 next

  1. Akbari, Saieed; Ghodrati, Amir Hossein; Hosseinzadeh, Mohammad Ali; Iranmanesh, Ali: Equimatchable regular graphs (2018)
  2. Bach, Eric; Sandlund, Bryce: Baby-step giant-step algorithms for the symmetric group (2018)
  3. Bolognini, Davide; Macchia, Antonio; Strazzanti, Francesco: Binomial edge ideals of bipartite graphs (2018)
  4. Bulutoglu, Dursun A.; Ryan, Kenneth J.: Integer programming for classifying orthogonal arrays (2018)
  5. Dzido, Tomasz; Jastrzȩbski, Andrzej: Turán numbers for odd wheels (2018)
  6. Ghosh, Swarnendu; Das, Nibaran; Gonçalves, Teresa; Quaresma, Paulo; Kundu, Mahantapas: The journey of graph kernels through two decades (2018)
  7. Kokkala, Janne I.; Östergård, Patric R.J.: The chromatic number of the square of the 8-cube (2018)
  8. Liu, Xiaogang; Liu, Shunyi: On the $A_\alpha$-characteristic polynomial of a graph (2018)
  9. Monnig, Nathan D.; Meyer, François G.: The resistance perturbation distance: a metric for the analysis of dynamic networks (2018)
  10. Östergård, Patric R.J.; Soicher, Leonard H.: There is no McLaughlin geometry (2018)
  11. Radhakrishnan, Adityanarayanan; Solus, Liam; Uhler, Caroline: Counting Markov equivalence classes for DAG models on trees (2018)
  12. Szöllősi, Ferenc; Östergård, Patric R.J.: Enumeration of Seidel matrices (2018)
  13. Aguilar, Cesar O.; Gharesifard, Bahman: Almost equitable partitions and new necessary conditions for network controllability (2017)
  14. Berkholz, Christoph; Bonsma, Paul; Grohe, Martin: Tight lower and upper bounds for the complexity of canonical colour refinement (2017)
  15. Brandt, Felix; Harrenstein, Paul; Seedig, Hans Georg: Minimal extending sets in tournaments (2017)
  16. Brijder, Robert; Traldi, Lorenzo: Isotropic matroids. III: Connectivity (2017)
  17. Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub: Optimal-depth sorting networks (2017)
  18. Carballosa, Walter; Fabila-Monroy, Ruy; Leaños, Jesús; Rivera, Luis Manuel: Regularity and planarity of token graphs (2017)
  19. Foucart, Simon; Skrzypek, Lesław: On maximal relative projection constants (2017)
  20. Francetić, Nevena; Herke, Sarada; McKay, Brendan D.; Wanless, Ian M.: On Ryser’s conjecture for linear intersecting multipartite hypergraphs (2017)

1 2 3 ... 21 22 23 next