distinct nodes).combinat::freeTreesLabelled – labelled free trees
combinat::freeTreesLabelled represents the combinatorial class of labelled free trees (i.e. connected acyclic graphs on distinct nodes).
Such trees are currently represented by lists of edges; this is likely to change!
fromListPrufer – Prüfer bijective correspondence
combinat::freeTreesLabelled::fromListPrufer(list of positive integer l)
Returns the free tree on 
nodes associated via the Prüfer correspondence to the list l of 
integers between 
and 
.
toListPrufer – Prüfer bijective correspondence
combinat::freeTreesLabelled::toListPrufer(dom t)
Returns the list l of 
integers between 
and 
associated to the free tree t on 
nodes via the Prüfer correspondence.
Changes in MuPAD 3.1
New Function.