A k-ary tree is a tree where each vertex has up to k children.
The symmetry of the graph depends on n
.
Value
An igraph_ptr
object.
See also
Other deterministic generators:
graph_create()
,
graph_empty()
,
graph_famous()
,
graph_full()
,
graph_square_lattice()
,
graph_star()