Digraphs

This page contains some catalogues of directed graphs prepared by Brendan McKay.

Tournaments

Here are the non-isomorphic tournaments up to 10 vertices. Each is given as the upper triangle of the adjacency matrix in row order, on one line without spaces.

2 vertices (1)
3 vertices (2)
4 vertices (4)
5 vertices (12)
6 vertices (56)
7 vertices (456)
8 vertices (6880)
9 vertices (191536)
10 vertices (gzipped) (9733056)

Regular and Semi-regular Tournaments

A tournament of odd order n is regular if the out-degree of each vertex is (n-1)/2. A tournament of even order n is semi-regular if the out-degree of each vertex is n/2-1 or n/2. Here are the regular and semi-regular tournaments of order up to 13.

Each is given as the upper triangle of the adjacency matrix in row order, on one line without spaces.

3 vertices (1)
4 vertices (1)
5 vertices (1)
6 vertices (5)
7 vertices (3)
8 vertices (85)
9 vertices (15)
10 vertices (13333)
11 vertices (1223)
12 vertices (gzipped) (19434757): Part a  Part b  (these unpack to 1.3GB altogether)
13 vertices (gzipped) (1495297)

A regular tournament is doubly-regular if each pair of vertices is jointly connected to exactly (n-3)/4 others. The order must be one less than a multiple of 4. These tournaments are related to skew Hadamard matrices. Ted Spence was the first to find them up to 27 vertices but I have recomputed them. The incomplete lists on larger sizes were computed using skew Hadamard matrices from Christos Koukouvinos's catalogue.

3 vertices (1)
7 vertices (1)
11 vertices (1)
15 vertices (2)
19 vertices (2)
23 vertices (37)
27 vertices (722)
31 vertices (5 incomplete)
35 vertices (486 incomplete)
39 vertices (1560 incomplete)
43 vertices (2178 incomplete)
47 vertices (3 incomplete)
51 vertices (gzipped) (36350 incomplete)

Locally-transitive Tournaments

A tournament is locally-transitive if, for each vertex v, the in-neighbourhood and the out-neighbourhood of v are both transitive tournaments.

Here are the non-isomorphic locally-transitive tournaments up to 20 vertices. Each is given as the upper triangle of the adjacency matrix in row order, on one line without spaces.

3 vertices (2)
4 vertices (2)
5 vertices (4)
6 vertices (6)
7 vertices (10)
8 vertices (16)
9 vertices (30)
10 vertices (52)
11 vertices (94)
12 vertices (172)
13 vertices (316)
14 vertices (586)
15 vertices (1096)
16 vertices (gzipped) (2048)
17 vertices (gzipped) (3856)
18 vertices (gzipped) (7286)
19 vertices (gzipped) (13798)
20 vertices (gzipped) (26216)

Acyclic digraphs

Here are the acyclic digraphs up to 8 points. Each is given as the upper triangle of the adjacency matrix in row order, on one line without spaces. The lower triangle is zero; that is, the points are in topological order.

2 vertices (2)
3 vertices (6)
4 vertices (31)
5 vertices (302)
6 vertices (5984)
7 vertices (gzipped) (243668)
8 vertices (gzipped)  part 1  part 2  part 3  part 4  (20286025)

 


Page Master: Brendan McKay, bdm@cs.anu.edu.au and http://cs.anu.edu.au/~bdm.

Up to the combinatorial data page