special-tree-graceful-labeling

special-tree-graceful-labeling requires either a tree as an argument, or no argument, in which case a tree will be read from manual input. There is one caveat to special-tree-graceful-labeling and that is that if the tree provided is a special tree $\mathit{Special}(k,t)$, the ordering returned will be for the tree as it would be generated by (make-special-tree k t). This could lead to some confusion, so we recommend calling special-tree-graceful-labeling with a graph as an argument, and which has been generated by make-special-tree.

CL-USER 3 > (special-tree-graceful-labeling (make-special-tree 3 2))
(0 9 1 8 6 4 5 3 7 2)

This labeling is illustrated in Figure

Figure: $\mathit{Special}(3,2)$ labeled