.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.3.
.TH NAUTY-GENSPECIALG "1" "April 2024" "nauty 2.8.8" "Nauty Manual"
.SH NAME
nauty-genspecialg \- generate special graphs
.SH SYNOPSIS
.B genspecialg
[\fI\,-s|-g|-z|-d|-v\/\fR] [\fI\,-q\/\fR] [\fI\,graph options\/\fR]... [\fI\,outfile\/\fR]
.SH DESCRIPTION
.IP
Generate special graphs.
.SH OPTIONS
.SS "General Options:"
.HP
\fB\-s\fR : Write in sparse6 format (default)
.HP
\fB\-g\fR : Write in graph6 format
.HP
\fB\-z\fR : Make digraph versions and write in digraph6 format
.HP
\fB\-d\fR : Write in dreadnaut format (can be used with \fB\-z\fR)
.HP
\fB\-v\fR : For each graph, report the size to stderr
.HP
\fB\-q\fR : Suppress summary
.SS "Special Options:"
.IP
If defined, the digraph version is shown in parentheses;
# size parameter called n in the descriptions.
.TP
\fB\-p\fR#
: path (directed path) on n vertices
.TP
\fB\-c\fR#
: cycle (directed cycle) on n vertices
.TP
\fB\-e\fR#
: empty graph (digraph with loops only) on n vertices
.TP
\fB\-k\fR#
: complete graph (with loops) on n vertices
.HP
\fB\-b\fR#,#[,#] : complete bipartite graph (directed l\->r) on n vertices
.IP
minus a matching of given size if present
.HP
\fB\-m\fR#,#... : multipartite graph
.TP
\fB\-a\fR#
: antiprism (directed antiprism) on 2n
.TP
\fB\-l\fR#
: moebius ladder (directed cycle, undirected rungs) with # rungs
.HP
\fB\-D\fR#,# : de Bruijn graph (digraph). D(m,t) has order m^t
.TP
\fB\-w\fR#
: wheel with # spokes (directed out from hub)
.TP
\fB\-f\fR#
: flower snark on 4n vertices
.TP
\fB\-L\fR#
: triangular graph, the linegraph of K_n
.HP
\fB\-P\fR#,# : generalized Petersen graph; usual one is \fB\-P5\fR,2
.TP
\fB\-Q\fR#  \fB\-Q\fR#,#
: hypercube on 2^n vertices. Q(n,t) has vertices {0,1}^n
and edges for hamming distance t.  t=1 is default.
.TP
\fB\-A\fR#
: connected antiregular graph on n vertices
.HP
\fB\-J\fR#,# : Johnson graph J(n,k), args are n and k
.HP
\fB\-K\fR#,# \fB\-K\fR#,#,# : Generalized Kneser graph. K(n,k,t) is graph of k\-subsets
.IP
of an n\-set whose intersection is t. Default for t is 0.
.HP
\fB\-C\fR#[,#] : circulant (di)graph; first arg is the number of vertices
.HP
\fB\-T\fR#[,#] : theta (di)graph Theta(#,#,...), give path lengths
.HP
\fB\-G\fR#[,#] : (directed) grid, use negative values for open directions
.TP
\fB\-Y\fR#
: Paley graph or digraph, depending on size. Nondeterministic.
.HP
\fB\-X\fR# : produce a named graph, # can be an index or a partial name.
.IP
Use genspecialg \fB\-\-Xhelp\fR for a list.
.IP
Any number of graphs can be generated at once.