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

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

1 2 3 ... 28 29 30 next

  1. Chang, Mun See; Jefferson, Christopher: Disjoint direct product decompositions of permutation groups (2022)
  2. Araujo-Pardo, G.; Dalfó, C.; Fiol, M. A.; López, N.: Bipartite biregular Moore graphs (2021)
  3. Araya, Makoto; Harada, Masaaki; Saito, Ken: Characterization and classification of optimal LCD codes (2021)
  4. Bausch, Johannes; Leditzky, Felix: Error thresholds for arbitrary Pauli noise (2021)
  5. DeBiasio, Louis; Lo, Allan; Molla, Theodore; Treglown, Andrew: Transitive tournament tilings in oriented graphs with large minimum total degree (2021)
  6. Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
  7. Dickinson, Peter J. C.; de Zeeuw, Reinier: Generating irreducible copositive matrices using the stable set problem (2021)
  8. Dubinsky, Manuel; Massri, César; Taubin, Gabriel: Minimum spanning tree cycle intersection problem (2021)
  9. Fabrici, Igor; Madaras, Tomáš; Timková, Mária; Van Cleemput, Nico; Zamfirescu, Carol T.: Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (2021)
  10. Ghalavand, Ali; Ashrafi, Ali Reza; Hakimi-Nezhaad, Mardjan: On Mostar and edge Mostar indices of graphs (2021)
  11. Gorla, Daniele; Salvo, Ivano: Conflict vs causality in event structures (2021)
  12. Gruen, Angus; Morrison, Scott: Computing modular data for pointed fusion categories (2021)
  13. Gunnells, Paul E.: Generalized Catalan numbers from hypergraphs (2021)
  14. Jayawardene, Chula J.; Narváez, David; Radziszowski, Stanisław: Star-critical Ramsey numbers for cycles versus (K_4) (2021)
  15. Jefferson, Christopher; Pfeiffer, Markus; Wilson, Wilf A.; Waldecker, Rebecca: Permutation group algorithms based on directed graphs (2021)
  16. Krčadinac, Vedran: A new partial geometry (\mathrmpg(5,5,2)) (2021)
  17. Sreekumar, K. G.; Manilal, K.: Automorphism groups of some families of bipartite graphs (2021)
  18. Turcotte, Jérémie; Yvon, Samuel: 4-cop-win graphs have at least 19 vertices (2021)
  19. Xu, Kexiang; Ilić, Aleksandar; Iršič, Vesna; Klavžar, Sandi; Li, Huimin: Comparing Wiener complexity with eccentric complexity (2021)
  20. Abrosimov, Mikhaĭl Borisovich; Sudani, Hayder Hussein Karim; Lobov, Aleksandr Andreevich: Construction of all minimal edge extensions of the graph with isomorphism rejection (2020)

1 2 3 ... 28 29 30 next