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

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

1 2 3 ... 22 23 24 next

  1. Jefferson, Christopher; Pfeiffer, Markus; Waldecker, Rebecca: New refiners for permutation group search (2019-2019)
  2. Araya, Makoto; Harada, Masaaki: On the classification of linear complementary dual codes (2019)
  3. Dybizbański, Janusz; Nenca, Anna: Oriented chromatic number of Cartesian products and strong products of paths (2019)
  4. Justel, Claudia; Rocha, Carlos; Chaves, Emanuelle; Chaves, Anderson; Avelino, Geraldo: Augmenting the algebraic connectivity for certain families of graphs (2019)
  5. Akbari, Saieed; Ghodrati, Amir Hossein; Hosseinzadeh, Mohammad Ali; Iranmanesh, Ali: Equimatchable regular graphs (2018)
  6. Alfaro, Carlos A.; Valencia, Carlos E.: Small clique number graphs with three trivial critical ideals (2018)
  7. Alfaro, Carlos A.; Valencia, Carlos E.; Vázquez-Ávila, Adrián: Digraphs with at most one trivial critical ideal (2018)
  8. Aurora, Pawan; Mehta, Shashank K.: The QAP-polytope and the graph isomorphism problem (2018)
  9. Azarija, Jernej; Marc, Tilen: There is no (75,32,10,16) strongly regular graph (2018)
  10. Bach, Eric; Sandlund, Bryce: Baby-step giant-step algorithms for the symmetric group (2018)
  11. Baker, Jonathan; Vander Meulen, Kevin N.; Van Tuyl, Adam: Shedding vertices of vertex decomposable well-covered graphs (2018)
  12. Bolognini, Davide; Macchia, Antonio; Strazzanti, Francesco: Binomial edge ideals of bipartite graphs (2018)
  13. Brinkmann, Philip; Ziegler, Günter M.: Small $f$-vectors of 3-spheres and of 4-polytopes (2018)
  14. Bulutoglu, Dursun A.; Ryan, Kenneth J.: Integer programming for classifying orthogonal arrays (2018)
  15. Dzido, Tomasz; Jastrzȩbski, Andrzej: Turán numbers for odd wheels (2018)
  16. Gao, Yibo: The largest pure partial planes of order 6 have size 25 (2018)
  17. Ghosh, Swarnendu; Das, Nibaran; Gonçalves, Teresa; Quaresma, Paulo; Kundu, Mahantapas: The journey of graph kernels through two decades (2018)
  18. Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu: Graphs with few Hamiltonian Cycles (2018) arXiv
  19. Knueven, Ben; Ostrowski, Jim; Pokutta, Sebastian: Detecting almost symmetries of graphs (2018)
  20. Kokkala, Janne I.; Östergård, Patric R. J.: The chromatic number of the square of the 8-cube (2018)

1 2 3 ... 22 23 24 next