The new graph will contain the input graph the given number of times, as unconnected components.
Arguments
- x
The input graph.
- n
Number of times to replicate it.
- mark
Whether to mark the vertices with a
which
attribute, an integer number denoting which replication the vertex is coming from.- ...
Additional arguments to satisfy S3 requirements, currently ignored.
See also
Other functions for manipulating graph structure:
+.igraph()
,
add_edges()
,
add_vertices()
,
complementer()
,
compose()
,
connect()
,
contract()
,
delete_edges()
,
delete_vertices()
,
difference()
,
difference.igraph()
,
disjoint_union()
,
edge()
,
igraph-minus
,
intersection()
,
intersection.igraph()
,
path()
,
permute()
,
reverse_edges()
,
simplify()
,
union()
,
union.igraph()
,
vertex()
Other functions for manipulating graph structure:
+.igraph()
,
add_edges()
,
add_vertices()
,
complementer()
,
compose()
,
connect()
,
contract()
,
delete_edges()
,
delete_vertices()
,
difference()
,
difference.igraph()
,
disjoint_union()
,
edge()
,
igraph-minus
,
intersection()
,
intersection.igraph()
,
path()
,
permute()
,
reverse_edges()
,
simplify()
,
union()
,
union.igraph()
,
vertex()
Examples
rings <- make_ring(5) * 5