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] [graph options]... [outfile]
10

DESCRIPTION

12              Generate special graphs.
13

OPTIONS

15   General Options:
16       -s : Write in sparse6 format (default)
17
18       -g : Write in graph6 format
19
20       -z : Make digraph versions and write in digraph6 format
21
22       -d : Write in dreadnaut format (can be used with -z)
23
24       -v : For each graph, report the size to stderr
25
26       -q : Suppress summary
27
28   Special Options:
29              If  defined, the digraph version is shown in parentheses: # size
30              parameter called n in the descriptions.
31
32       -p#    : path (directed path) on n vertices
33
34       -c#    : cycle (directed cycle) on n vertices
35
36       -e#    : empty graph (digraph with loops only) on n vertices
37
38       -k#    : complete graph (with loops) on n vertices
39
40       -b#,#[,#] : complete bipartite graph (directed l->r) on n vertices
41
42              minus a matching of given size if present
43
44       -m#,#... : multipartite graph
45
46       -a#    : antiprism (directed antiprism) on 2n
47
48       -l#    : moebius ladder (directed cycle, undirected rungs) with # rungs
49
50       -D#,# : de Bruijn graph (digraph). D(m,t) has order m^t
51
52       -w#    : wheel with # spokes (directed out from hub)
53
54       -f#    : flower snark on 4n vertices
55
56       -L#    : triangular graph, the linegraph of K_n
57
58       -P#,# : generalized Petersen graph; usual one is -P5,2
59
60       -Q#  -Q#,#
61              : hypercube on 2^n vertices. Q(n,t)  has  vertices  {0,1}^n  and
62              edges for hamming distance t.  t=1 is default.
63
64       -A#    : connected antiregular graph on n vertices
65
66       -J#,# : Johnson graph J(n,k), args are n and k
67
68       -K#,#  -K#,#,#  : Generalized Kneser graph. K(n,k,t) is graph of k-sub‐
69              sets
70
71              of an n-set whose intersection is t. Default for t is 0.
72
73       -C#[,#] : circulant (di)graph; first arg is the number of vertices
74
75       -T#[,#] : theta (di)graph Theta(#,#,...), give path lengths
76
77       -G#[,#] : (directed) grid, use negative values for open directions
78
79       -Y#    : Paley graph or digraph, depending on size. Nondeterministic.
80
81       -X# : produce a named graph, # can be an index or a partial name.
82
83              Use genspecialg --Xhelp for a list.
84
85              Any number of graphs can be generated at once.
86
87
88
89nauty 2.8.8                      November 2023            NAUTY-GENSPECIALG(1)
Impressum