In this paper we prove that a vertex-centered automorphism of a tree g
ives a proper factor of the characteristic polynomial of its distance
or adjacency matrix. We also show that the characteristic polynomial o
f the distance matrix of any graph always has a factor of degree equal
to the number of vertex orbits of the graph. These results are applie
d to full k-ary trees and some other problems.