Arguments
n
The number of vertices in the graph.
p.or.m
Either the probability for drawing an edge between two
arbitrary vertices (G(n,p) graph), or the number of edges in the
graph (for G(n,m) graphs).
type
The type of the random graph to create, either gnp
(G(n,p) graph) or gnm
(G(n,m) graph).
directed
Logical, whether the graph will be directed, defaults
to FALSE.
loops
Logical, whether to add loop edges, defaults to FALSE.
...
Additional arguments, ignored.