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

Showing results 1 to 20 of 480.
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. Jefferson, Christopher; Jonauskyte, Eliza; Pfeiffer, Markus; Waldecker, Rebecca: Minimal and canonical images (2019)
  5. Justel, Claudia; Rocha, Carlos; Chaves, Emanuelle; Chaves, Anderson; Avelino, Geraldo: Augmenting the algebraic connectivity for certain families of graphs (2019)
  6. Östergård, Patric R. J.: The sextuply shortened binary Golay code is optimal (2019)
  7. Zhang, Huihui; Li, Shuchao; Xu, Baogen: Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index (2019)
  8. Akbari, Saieed; Ghodrati, Amir Hossein; Hosseinzadeh, Mohammad Ali; Iranmanesh, Ali: Equimatchable regular graphs (2018)
  9. Alfaro, Carlos A.; Valencia, Carlos E.: Small clique number graphs with three trivial critical ideals (2018)
  10. Alfaro, Carlos A.; Valencia, Carlos E.; Vázquez-Ávila, Adrián: Digraphs with at most one trivial critical ideal (2018)
  11. Aurora, Pawan; Mehta, Shashank K.: The QAP-polytope and the graph isomorphism problem (2018)
  12. Azarija, Jernej; Marc, Tilen: There is no (75,32,10,16) strongly regular graph (2018)
  13. Bach, Eric; Sandlund, Bryce: Baby-step giant-step algorithms for the symmetric group (2018)
  14. Baker, Jonathan; Vander Meulen, Kevin N.; Van Tuyl, Adam: Shedding vertices of vertex decomposable well-covered graphs (2018)
  15. Bird, E. M.; Street, Deborah J.: Complete enumeration of all geometrically non-isomorphic three-level orthogonal arrays in 18 runs (2018)
  16. Bolognini, Davide; Macchia, Antonio; Strazzanti, Francesco: Binomial edge ideals of bipartite graphs (2018)
  17. Brinkmann, Philip; Ziegler, Günter M.: Small $f$-vectors of 3-spheres and of 4-polytopes (2018)
  18. Bulutoglu, Dursun A.; Ryan, Kenneth J.: Integer programming for classifying orthogonal arrays (2018)
  19. Buratti, Marco; Wassermann, Alfred: On decomposability of simple cyclic triple systems (2018)
  20. Dzido, Tomasz; Jastrzȩbski, Andrzej: Turán numbers for odd wheels (2018)

1 2 3 ... 22 23 24 next