labelled tree

A labelling on a tree $T$ is an assignment of numbers $1, 2, \dots, n$ ( $n$ is the number of vertices) to each vertex of the tree up to graph isomorphism (morphisms that preserve connectivity).