igraph (version 1.0.1)

make_star: Create a star graph, a tree with n vertices and n - 1 leaves

Description

star creates a star graph, in this every single vertex is connected to the center vertex and nobody else.

Usage

make_star(n, mode = c("in", "out", "mutual", "undirected"), center = 1)
star(...)

Arguments

n

Number of vertices.

mode

It defines the direction of the edges, in: the edges point to the center, out: the edges point from the center, mutual: a directed star is created with mutual edges, undirected: the edges are undirected.

center

ID of the center vertex.

...

Passed to make_star.

Value

An igraph graph.

See Also

Other determimistic constructors: atlas, graph.atlas, graph_from_atlas; chordal_ring, graph.extended.chordal.ring, make_chordal_ring; directed_graph, graph, graph.famous, make_directed_graph, make_graph, make_undirected_graph, undirected_graph; empty_graph, graph.empty, make_empty_graph; from_edgelist, graph.edgelist, graph_from_edgelist; from_literal, graph.formula, graph_from_literal; full_citation_graph, graph.full.citation, make_full_citation_graph; full_graph, graph.full, make_full_graph; graph.lattice, lattice, make_lattice; graph.ring, make_ring, ring; graph.tree, make_tree, tree

Examples

# NOT RUN {
make_star(10, mode = "out")
make_star(5, mode = "undirected")
# }

Run the code above in your browser using DataCamp Workspace