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.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

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

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

1 2 3 ... 29 30 31 next

  1. Al-Yakoob, Salem; Stevanović, Dragan: On stepwise transmission irregular graphs (2022)
  2. Chang, Mun See; Jefferson, Christopher: Disjoint direct product decompositions of permutation groups (2022)
  3. Dokuchaev, Mikhailo; Mandel, Arnaldo; Plakhotnyk, Makar: The cone of quasi-semimetrics and exponent matrices of tiled orders (2022)
  4. Goedgebeur, Jan; Van Overberghe, Steven: New bounds for Ramsey numbers (R ( K_k - e , K_l - e )) (2022)
  5. Kiefer, Sandra; Neuen, Daniel: The power of the Weisfeiler-Leman algorithm to decompose graphs (2022)
  6. Kurz, Sascha: On the number of minimal codewords in codes generated by the adjacency matrix of a graph (2022)
  7. Turcotte, Jérémie: Cops and robbers on (2K_2)-free graphs (2022)
  8. Xu, Si-Ao; Li, Yun-Xiang; Hua, Hongbo; Pan, Xiang-Feng: On the resistance diameters of graphs and their line graphs (2022)
  9. Yan, Zhidan; Wang, Wei: The smallest pair of cospectral cubic graphs with different chromatic indexes (2022)
  10. Araujo-Pardo, G.; Dalfó, C.; Fiol, M. A.; López, N.: Bipartite biregular Moore graphs (2021)
  11. Araya, Makoto; Harada, Masaaki; Saito, Ken: Characterization and classification of optimal LCD codes (2021)
  12. Azam, Naveed Ahmed; Shurbevski, Aleksandar; Nagamochi, Hiroshi: A method for enumerating pairwise compatibility graphs with a given number of vertices (2021)
  13. Bausch, Johannes; Leditzky, Felix: Error thresholds for arbitrary Pauli noise (2021)
  14. da Silva, Celso M. jun.; Del-Vecchio, Renata R.; Monteiro, Bruno B.: Relating centralities in graphs and the principal eigenvector of its distance matrix (2021)
  15. DeBiasio, Louis; Lo, Allan; Molla, Theodore; Treglown, Andrew: Transitive tournament tilings in oriented graphs with large minimum total degree (2021)
  16. Defranco, Mario; Gunnells, Paul E.: Hypergraph matrix models (2021)
  17. de Souza Maceira Belay, Diego; de Freitas, Maria Aguieiras A.; da Silva, Celso M. jun.: On trees with algebraic connectivity greater than or equal to (2(1-\cos(\frac\pi7))) (2021)
  18. Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
  19. Dickinson, Peter J. C.; de Zeeuw, Reinier: Generating irreducible copositive matrices using the stable set problem (2021)
  20. Dubinsky, Manuel; Massri, César; Taubin, Gabriel: Minimum spanning tree cycle intersection problem (2021)

1 2 3 ... 29 30 31 next