.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.47.4.
.TH NAUTY-GENSPECIALG "1" "August 2016" "nauty 2.6.7" "Nauty Manual"
.SH NAME
nauty-genspecialg \- generate special graphs
.SH SYNOPSIS
.B genspecialg
[\fI\,-s|-g|-z|-d\/\fR] [\fI\,-q\/\fR] [\fI\,-p#|-c#|-e#|-k#|-b#,#|-Q#|-f#|-J#,#|-P#,#|C#\/\fR[\fI\,,#\/\fR]\fI\,|G#\/\fR[\fI\,,#\/\fR]\fI\,|T#\/\fR[\fI\,,#\/\fR]] [\fI\,outfile\/\fR]
.SH DESCRIPTION
.IP
Generate one particular graph.
.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\-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
.TP
\fB\-f\fR#
: flower snark on 4*# vertices
.HP
\fB\-P\fR#,# : generalized Petersen graph; usual one is \fB\-P5\fR,2
.TP
\fB\-Q\fR#
: hypercube on 2^n vertices and degree n.
.HP
\fB\-J\fR#,# : Johnson graph J(n,k), args are n and k.
.HP
\fB\-C\fR#[,#] : circulant (di)graph.
.HP
\fB\-T\fR#[,#] : theta (di)graph Theta(#[,#]), give path lengths.
.HP
\fB\-G\fR#[,#] : (directed) grid, use negative values for open directions