Search graph database
Browse collections
-
Arc-transitive tetravalent graphs
Last updated: 22 Dec 2015 | Contains: 4820 graphs
This collection contains a complete census of all connected arc-transitive tetravalent graphs of order at most 640. The census is a joint project by Primož Potočnik, Pablo Spiga, and Gabriel Verret (source).
-
Regular graphs
Last updated: 22 Dec 2015 | Contains: 140959 graphs
This collection contains all connected regular graphs of girth 3 up to the order 12, of girth 4 up to the order 16, and of girth 5 up to the order 23 (including graphs of girth 6). The collection was prepared using the program geng that is a part a of nauty software package of Brendan McKay (...
-
Trees
Last updated: 15 Dec 2020 | Contains: 522958 graphs
This collection contains all non-trivial trees up to the order 19, as prepared by Gordon Royle (source).
-
Vertex-transitive cubic graphs
Last updated: 15 Dec 2020 | Contains: 111360 graphs
This collection contains a complete census of all connected vertex-transitive cubic graphs of order at most 1280. The census is a joint project by Primož Potočnik, Pablo Spiga, and Gabriel Verret (source). The properties of graphs were collected from the DiscreteZOO library (source).
-
Highly irregular graphs
Last updated: 15 Dec 2020 | Contains: 21869 graphs
A connected graph is highly irregular if the neighbours of each vertex have distinct degrees. Such graphs exist on all orders except 3, 5 and 7. The census lists all highly irregular graphs up to the order 15 and was provided by Brendan McKay (source).