All these functions create graphs in a deterministic way. graph.empty
is the simplest one, this creates an empty graph.
graph
creates a graph with the given edges.
graph.adjacency
creates a graph from an adjacency matrix.
graph.star
creates a star graph, in this every single vertex is
connected to the center vertex and nobody else.
graph.lattice
is a flexible function, it can create lattices of
arbitrary dimensions, periodic or unperiodic ones.
graph.ring
is actually a special case of graph.lattice
,
it creates a one dimensional circular lattice.
graph.tree
creates regular trees.
graph.full
simply creates full graphs.
graph.atlas
creates graphs from the book An Atlas of Graphs by
Roland C. Read and Robin J. Wilson. The atlas contains all undirected
graphs with up to seven vertices, numbered from 0 up to 1252. The
graphs are listed:
{in increasing order of number of nodes;}
{for a fixed number of nodes, in increasing order of the number
of edges;}
{for fixed numbers of nodes and edges, in increasing order of
the degree sequence, for example 111223 < 112222;}
{for fixed degree sequence, in increasing number of
automorphisms.}