construct banana tree
nonnegint; number of copies of star graph
nonnegint; number of edges in star graph
BananaTree(n,k) creates an (n,k) banana tree.
The banana tree is a graph constructed by connecting a single leaf from n distinct copies of a k-star graph with a single vertex distinct from the star graphs.
Each such graph has n*(k+1)+1 vertices and (n+1)*k edges.
B ≔ BananaTree⁡4,3
B≔Graph 1: an undirected graph with 17 vertices and 16 edge(s)
The GraphTheory[SpecialGraphs][BananaTree] command was introduced in Maple 2021.
For more information on Maple 2021 changes, see Updates in Maple 2021.
Download Help Document
What kind of issue would you like to report? (Optional)