AgraphG is a k-leaf power if there is a tree T such that the vertices ofG are the leaves of T and two vertices are adjacent in G if and only if their distance in T is at most k. In this situation T is called a k-leaf root of G. Motivated by the search for underlying phylogenetic trees, the notion of a k-leaf power was introduced and studied by Nishimura… (More)