Abstract: | A core of a graph G is a path P in G that is central with respect to the property of minimizing d(P) = Συ?V(G)d(υ, P), where d(υ, P) is the distance from vertex υ to path P. We present a linear algorithm for finding a core of a tree. Since the core of a graph is not necessarily unique, we also output a list of all the vertices which are in some core. |