1NAUTY-GENBG(1) Nauty Manual NAUTY-GENBG(1)
2
3
4
6 nauty-genbg - generate small bicoloured graphs
7
9 genbg [-c -ugs -vq -lzF] [-Z#] [-D#] [-A] [-d#|-d#:#] [-D#|-D#:#] n1 n2
10 [mine[:maxe]] [res/mod] [file]
11
13 Find all bicoloured graphs of a specified class.
14
15 n1 : the number of vertices in the first class
16
17 n2 : the number of vertices in the second class
18
19 mine:maxe : a range for the number of edges
20
21 #:0 means '# or more' except in the case 0:0
22
23 res/mod : only generate subset res out of subsets 0..mod-1
24
25 file : the name of the output file (default stdout)
26
27 -c : only write connected graphs
28
29 -z : all the vertices in the second class must have
30
31 different neighbourhoods
32
33 -F : the vertices in the second class must have at least two
34
35 neighbours of degree at least 2
36
37 -L : there is no vertex in the first class whose removal leaves
38
39 the vertices in the second class unreachable from each other
40
41 -Y# : two vertices in the second class must have at least # common
42 nbrs
43
44 -Z# : two vertices in the second class must have at most # common
45 nbrs
46
47 -A : no vertex in the second class has a neighbourhood which is a
48
49 subset of another vertex's neighbourhood in the second class
50
51 -D# : specify an upper bound for the maximum degree
52
53 Example: -D6.
54 You can also give separate maxima for the
55
56 two parts, for example: -D5:6
57
58 -d# : specify a lower bound for the minimum degree.
59
60 Again, you can specify it separately for the two parts: -d1:2
61
62 -g : use graph6 format for output (default)
63
64 -s : use sparse6 format for output
65
66 -a : use Greechie diagram format for output
67
68 -u : do not output any graphs, just generate and count them
69
70 -v : display counts by number of edges to stderr
71
72 -l : canonically label output graphs (using the 2-part colouring)
73
74 -q : suppress auxiliary output
75
76 See program text for much more information.
77
78
79
80nauty 2.7.3 September 2021 NAUTY-GENBG(1)