Vertex-exposure words distinguish all trees

For each ordering of the vertices of a finite simple graph, record the number of previously revealed neighbors at each step. The vertex-exposure enumerator records the distribution of these words over all vertex orderings. We prove that it distinguishes all finite trees up to isomorphism. After w