EnglishFrenchSpanish

OnWorks favicon

nauty-countg - Online in the Cloud

Run nauty-countg in OnWorks free hosting provider over Ubuntu Online, Fedora Online, Windows online emulator or MAC OS online emulator

This is the command nauty-countg that can be run in the OnWorks free hosting provider using one of our multiple free online workstations such as Ubuntu Online, Fedora Online, Windows online emulator or MAC OS online emulator

PROGRAM:

NAME


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

SYNOPSIS


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

DESCRIPTION


countg : Count graphs according to their properties.

pickg : Select graphs according to their properties.

ifile, ofile : Input and output files.

'-' and missing names imply stdin and stdout.

Miscellaneous switches:

-p# -p#:#
Specify range of input lines (first is 1)

-f With -p, assume input lines of fixed length (only used with a file in graph6
format)

-v Negate all constraints

-V List properties of every input matching constraints.

-q Suppress informative output.

Constraints:

Numerical constraints (shown here with following #) can take a single integer
value, or a range like #:#, #:, or :#. Each can also be preceded by '~', which
negates it. (For example, -~D2:4 will match any maximum degree which is _not_ 2,
3, or 4.) Constraints are applied to all input graphs, and only those which match
all constraints are counted or selected.

-n# number of vertices -e# number of edges

-d# minimum degree -D# maximum degree

-m# vertices of min degree -M# vertices of max degree

-r regular -b bipartite

-z# radius -Z# diameter

-g# girth (0=acyclic) -Y# total number of cycles

-T# number of triangles -K# number of maximal independent sets

-H# number of induced cycles

-E Eulerian (all degrees are even, connectivity not required)

-a# group size -o# orbits -F# fixed points -t vertex-transitive

-c# connectivity (only implemented for 0,1,2).

-i# min common nbrs of adjacent vertices; -I# maximum

-j# min common nbrs of non-adjacent vertices; -J# maximum

Sort keys:

Counts are made for all graphs passing the constraints.
Counts

are given separately for each combination of values occuring for the properties
listed as sort keys. A sort key is introduced by '--' and uses one of the letters
known as constraints. These can be combined: --n --e --r is the same as --ne
--r and --ner. The order of sort keys is significant.

Use nauty-countg online using onworks.net services


Free Servers & Workstations

Download Windows & Linux apps

Linux commands

  • 1
    abi-dumper
    abi-dumper
    abi-dumper - a tool to dump ABI of an
    ELF object containing DWARF debug info
    DESCRIPTION: NAME: ABI Dumper
    (abi-dumper) Dump ABI of an ELF object
    containing DW...
    Run abi-dumper
  • 2
    abi-tracker
    abi-tracker
    abi-tracker - visualize ABI changes
    timeline of a C/C++ software library.
    DESCRIPTION: NAME: ABI Tracker
    (abi-tracker) Visualize ABI changes
    timeline of a C/C+...
    Run abi-tracker
  • 3
    copylinkp
    copylinkp
    copylink - replace a link with a copy
    of the linked file ...
    Run copylinkp
  • 4
    copymat
    copymat
    copymat - convert ASCII matrices into a
    database suitable for quick reading ...
    Run copymat
  • 5
    gatling
    gatling
    gatling - high performance file server ...
    Run gatling
  • 6
    gatos-conf
    gatos-conf
    gatos-conf - GUI GATOS configuration
    application. ...
    Run gatos-conf
  • More »

Ad