1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/make.R
\name{graph_from_atlas}
\alias{graph_from_atlas}
\alias{atlas}
\title{Create a graph from the Graph Atlas}
\usage{
graph_from_atlas(n)
atlas(...)
}
\arguments{
\item{n}{The id of the graph to create.}
\item{...}{Passed to \code{graph_from_atlas()}.}
}
\value{
An igraph graph.
}
\description{
\code{graph_from_atlas()} creates graphs from the book
\sQuote{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:
\enumerate{
\item in increasing order of number of nodes;
\item for a fixed number of nodes, in increasing order of the number
of edges;
\item for fixed numbers of nodes and edges, in increasing order of
the degree sequence, for example 111223 < 112222;
\item for fixed degree sequence, in increasing number of
automorphisms.
}
}
\examples{
## Some randomly picked graphs from the atlas
graph_from_atlas(sample(0:1252, 1))
graph_from_atlas(sample(0:1252, 1))
}
\seealso{
Other deterministic constructors:
\code{\link{graph_from_edgelist}()},
\code{\link{graph_from_literal}()},
\code{\link{make_}()},
\code{\link{make_chordal_ring}()},
\code{\link{make_empty_graph}()},
\code{\link{make_full_citation_graph}()},
\code{\link{make_full_graph}()},
\code{\link{make_graph}()},
\code{\link{make_lattice}()},
\code{\link{make_ring}()},
\code{\link{make_star}()},
\code{\link{make_tree}()}
}
\concept{Graph Atlas.}
\concept{deterministic constructors}
|
