BananaTree - Maple Help

GraphTheory[SpecialGraphs]

 BananaTree
 construct banana tree

 Calling Sequence BananaTree(n, k)

Parameters

 n - nonnegint; number of copies of star graph k - nonnegint; number of edges in star graph

Description

 • 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.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $B≔\mathrm{BananaTree}\left(4,3\right)$
 ${B}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 17 vertices and 16 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(B\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{ChromaticNumber}\left(B\right)$
 ${2}$ (3)
 > $\mathrm{DrawGraph}\left(B,\mathrm{style}=\mathrm{planar}\right)$

Compatibility

 • The GraphTheory[SpecialGraphs][BananaTree] command was introduced in Maple 2021.