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

NAME

6       nauty-countg - count graphs according to a variety of properties
7

SYNOPSIS

9       [pickg|countg] [-fp#:#q -V] [--keys] [-constraints -v] [ifile [ofile]]
10

DESCRIPTION

12              countg : Count graphs according to their properties.
13
14              pickg : Select graphs according to their properties.
15
16              ifile, ofile : Input and output files.
17
18              '-' and missing names imply stdin and stdout.
19
20              Miscellaneous switches:
21
22       -p# -p#:#
23              Specify  range  of input lines (first is 1) May fail if input is
24              incremental.
25
26       -f     With -p, assume input lines of fixed length (only  used  with  a
27              file in graph6/digraph6 format)
28
29       -v     Negate all constraints
30
31       -V     List properties of every input matching constraints.
32
33       -l     Put  a blank line whenever the first parameter changes, if there
34              are at least two parameters.
35
36       -q     Suppress informative output.
37
38              Constraints:
39
40              Numerical constraints (shown here with following #) can  take  a
41              single  integer value, or a range like #:#, #:, or :#.  Each can
42              also be preceded by  '~',  which  negates  it.    (For  example,
43              -~D2:4 will match any maximum degree which is _not_ 2, 3, or 4.)
44              Constraints are applied to all  input  graphs,  and  only  those
45              which match all constraints are counted or selected.
46
47       -n#    number of vertices           -e#  number of edges
48
49       -L#    number of loops              -C   strongly connected
50
51       -d#    minimum (out-)degree         -D#  maximum (out-)degree
52
53       -m#    vertices of min (out-)degree -M#  vertices of max (out-)degree
54
55       -u#    minimum (in-)degree          -U#  maximum (in-)degree
56
57       -s#    vertices of min (out-)degree -S#  vertices of max (out-)degree
58
59       -r     regular                      -b   bipartite
60
61       -z#    radius                       -Z#  diameter
62
63       -g#    girth (0=acyclic)            -Y#  total number of cycles
64
65       -T#    number of triangles          -K#  number of maximal cliques
66
67       -B#    smallest side of some bipartition (0 if none)
68
69       -H#    number of induced cycles
70
71       -E     Eulerian (all degrees are even, connectivity not required)
72
73       -a#    group size  -o# orbits  -F# fixed points  -t vertex-transitive
74
75       -c#    connectivity (only implemented for 0,1,2).
76
77       -i#    min common nbrs of adjacent vertices;     -I# maximum
78
79       -j#    min common nbrs of non-adjacent vertices; -J# maximum
80
81              Sort keys:
82
83       Counts are made for all graphs passing the constraints.
84              Counts
85
86              are  given  separately  for each combination of values occurring
87              for the properties listed as sort keys.  A sort  key  is  intro‐
88              duced  by '--' and uses one of the letters known as constraints.
89              These can be combined:  --n --e  --r  is the same  as  --ne  --r
90              and --ner.  The order of sort keys is significant.
91
92              The output format matches the input, except that sparse6 is used
93              to output an incremental graph whose predecessor is not output.
94
95
96
97nauty 2.6.11                     February 2019                 NAUTY-COUNTG(1)
Impressum