networkx.generators.star_graph

networkx.generators.star_graph(n, create_using=None)[source]

Return the star graph

The star graph consists of one center node connected to n outer nodes.

Parameters:

n : int or iterable

If an integer, node labels are 0 to n with center 0. If an iterable of nodes, the center is the first.

create_using : Graph, optional (default Graph())

If provided this graph is cleared of nodes and edges and filled with the new graph. Usually used to set the type of the graph.

Notes

The graph has n+1 nodes for integer n. So star_graph(3) is the same as star_graph(range(4)).