1NAUTY-GENSPECIALG(1)             Nauty Manual             NAUTY-GENSPECIALG(1)
2
3
4

NAME

6       nauty-genspecialg - generate special graphs
7

SYNOPSIS

9       genspecialg                    [-s|-g|-z|-d|-v]                    [-q]
10       [-p#|-c#|-e#|-k#|-b#,#[,#]|-Q#|-f#|-J#,#|-P#,#|C#,#...|G#,#...|T#,#...]*
11       [outfile]
12

DESCRIPTION

14              Generate special graphs.
15

OPTIONS

17   General Options:
18       -s : Write in sparse6 format (default)
19
20       -g : Write in graph6 format
21
22       -z : Make digraph versions and write in digraph6 format
23
24       -d : Write in dreadnaut format (can be used with -z)
25
26       -v : For each graph, report the size to stderr
27
28       -q : Suppress summary
29
30   Special Options:
31              If  defined, the digraph version is shown in parentheses; # size
32              parameter called n in the descriptions.
33
34       -p#    : path (directed path) on n vertices.
35
36       -c#    : cycle (directed cycle) on n vertices.
37
38       -e#    : empty graph (digraph with loops only) on n vertices.
39
40       -k#    : complete graph (with loops) on n vertices
41
42       -b#,#[,#] : complete bipartite graph (directed l->r) on n vertices
43
44              minus a matching of given size if present
45
46       -f#    : flower snark on 4*# vertices
47
48       -P#,# : generalized Petersen graph; usual one is -P5,2
49
50       -Q#    : hypercube on 2^n vertices and degree n.
51
52       -J#,# : Johnson graph J(n,k), args are n and k.
53
54       -C#[,#] : circulant (di)graph.
55
56       -T#[,#] : theta (di)graph Theta(#,#,...), give path lengths.
57
58       -G#[,#] : (directed) grid, use negative values for open directions
59
60              Any number of graphs can be generated at once.
61
62
63
64nauty 2.8.6                      November 2022            NAUTY-GENSPECIALG(1)