.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.3.
.TH NAUTY-GENRANG "1" "April 2024" "nauty 2.8.8" "Nauty Manual"
.SH NAME
nauty-genrang \- generate random graphs
.SH SYNOPSIS
.B genrang
[\fI\,-P#|-P#/#|-e#|-r#|-R#|-d#\/\fR] [\fI\,-M#\/\fR] [\fI\,-l#\/\fR] [\fI\,-m#\/\fR] [\fI\,-t\/\fR] [\fI\,-T\/\fR] [\fI\,-a\/\fR] [\fI\,-s|-g|-z\/\fR] [\fI\,-S#\/\fR] [\fI\,-q\/\fR] \fI\,n|n1,n2 num \/\fR[\fI\,outfile\/\fR]
.SH DESCRIPTION
.IP
Generate random graphs.
.TP
n
: number of vertices
.IP
n1,n2 : number of vertices (bipartite graph)
.IP
num : number of graphs
.IP
A bipartite variant is only available if specified below.
.TP
\fB\-s\fR
: Write in sparse6 format (default)
.TP
\fB\-g\fR
: Write in graph6 format
.TP
\fB\-z\fR
: Make random digraphs and write in digraph6 format
.HP
\fB\-P\fR#/# : Give edge probability; \fB\-P\fR# means \fB\-P1\fR/#.
.IP
Bipartite version available.
.HP
\fB\-e\fR# : Give the number of edges
.IP
Bipartite version available.
.HP
\fB\-r\fR# : Make regular of specified degree
.HP
\fB\-d\fR# : Make regular of specified degree (pseudorandom)
.IP
With \fB\-z\fR, #\-in #\-out digraph without loops
.IP
Bipartite version: this is the degree on the first side.
.HP
\fB\-M\fR# : In conjunction with \fB\-d\fR, make the distribution more uniform
.IP
by running a Markov chain for #*n steps starting at the
pseudorandom graph.
.HP
\fB\-R\fR# : Make regular of specified degree but output
.IP
as vertex count, edge count, then list of edges
.HP
\fB\-l\fR# : Maximum loop multiplicity (default 0)
.HP
\fB\-m\fR# : Maximum multiplicity of non\-loop edge (default and minimum 1)
.TP
\fB\-t\fR
: Make a random spanning tree of a complete graph
.IP
or complete bipartite graph
.TP
\fB\-T\fR
: Make a random tournament (implies \fB\-z\fR)
.TP
\fB\-a\fR
: Make invariant under a random permutation
.HP
\fB\-S\fR# : Specify random generator seed (default nondeterministic)
.TP
\fB\-q\fR
: suppress auxiliary output