EnglishFrenchSpanish

Ad


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

  • 1
    DivFix++
    DivFix++
    DivFix++ is yours AVI video repair and
    preview software. It designed for repair
    and preview files which are on download
    from ed2k(emule), torrent, gnutella, ftp...
    Download DivFix++
  • 2
    JBoss Community
    JBoss Community
    Community driven projects featuring the
    latest innovations for cutting edge
    apps. Our flagship project JBoss AS is
    the leading Open Source,
    standards-compliant...
    Download JBoss Community
  • 3
    Django Filer
    Django Filer
    django Filer is a file management
    application for django that makes
    handling files and images a breeze.
    django-filer is a file management
    application for djang...
    Download Django Filer
  • 4
    xCAT
    xCAT
    Extreme Cluster Administration Toolkit.
    xCAT is a scalable cluster management
    and provisioning tool that provides
    hardware control, discovery, and OS
    diskful/di...
    Download xCAT
  • 5
    Psi
    Psi
    Psi is cross-platform powerful XMPP
    client designed for experienced users.
    There are builds available for MS
    Windows, GNU/Linux and macOS.. Audience:
    End Users...
    Download Psi
  • 6
    Blobby Volley 2
    Blobby Volley 2
    Official continuation of the famous
    Blobby Volley 1.x arcade game..
    Audience: End Users/Desktop. User
    interface: OpenGL, SDL. Programming
    Language: C++, Lua. C...
    Download Blobby Volley 2
  • More »

Linux commands

Ad