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

NAME

6       nauty-multig - generate small multigraphs with given underlying graph
7

SYNOPSIS

9       multig [-q] [-u|-T|-G|-A|-B] [-e#|-e#:#]
10

DESCRIPTION

12              [-m#] [-f#] [-D#|-r#|-l#] [infile [outfile]]
13
14              Read  undirected  loop-free  graphs and replace their edges with
15              multiple
16
17              edges in all possible ways (multiplicity at least  1).   Isomorā€
18              phic multigraphs derived from the same input are suppressed.  If
19              the input graphs are non-isomorphic then the output  graphs  are
20              also.
21
22       -e# | -e#:#
23              specify  a  value or range of the total number of edges counting
24              multiplicities
25
26       -m# maximum edge multiplicity (minimum is 1)
27
28       -D# upper bound on maximum degree
29
30       -r# make regular of specified degree (incompatible with -l, -D, -e)
31
32       -l# make regular multigraphs with multiloops, degree #
33
34              (incompatible with -r, -D, -e)
35
36              Either -l, -r, -D, -e or -m with a finite maximum must be  given
37              -f#  Use  the  group  that fixes the first # vertices setwise -T
38              use a simple text output format (nv ne {v1 v2 mult}) -G  like -T
39              but includes group size as third item (if less than 10^10)
40
41              The group size does not include exchange of isolated vertices.
42
43       -A     write  as the upper triangle of an adjacency matrix, row by row,
44              including the diagonal, and preceded by the number of vertices
45
46       -B     write as an integer matrix preceded by the number  of  rows  and
47              number of columns, where -f determines the number of rows
48
49       -u     no output, just count them
50
51       -q     suppress auxiliary information
52
53
54
55nauty 2.6.10                       July 2018                   NAUTY-MULTIG(1)
Impressum