On Finding the Core of a Tree with a Specified Length

Abstract A core of a graph G is a path P in G that is central with respect to the property of minizining d ( P ) = Σ υϵV ( G ) d ( υ , P ), where d ( υ , P ) is the distance from vertex υ to path P . This paper explores some properties of a core of a specified length.