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
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/make.R
\name{make_star}
\alias{make_star}
\alias{star}
\title{Create a star graph, a tree with n vertices and n - 1 leaves}
\usage{
make_star(n, mode = c("in", "out", "mutual", "undirected"), center = 1)
star(...)
}
\arguments{
\item{n}{Number of vertices.}
\item{mode}{It defines the direction of the
edges, \verb{in}: the edges point \emph{to} the center, \code{out}:
the edges point \emph{from} the center, \code{mutual}: a directed
star is created with mutual edges, \code{undirected}: the edges
are undirected.}
\item{center}{ID of the center vertex.}
\item{...}{Passed to \code{make_star()}.}
}
\value{
An igraph graph.
}
\description{
\code{star()} creates a star graph, in this every single vertex is
connected to the center vertex and nobody else.
}
\examples{
make_star(10, mode = "out")
make_star(5, mode = "undirected")
}
\seealso{
Other deterministic constructors:
\code{\link{graph_from_atlas}()},
\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_tree}()}
}
\concept{Star graph}
\concept{deterministic constructors}
|
