Abstract. If G is a graph, then its path graph, P_k(G), has vertex set identical with the set of paths of length k in G, with two vertices adjacent in P_k(G) if and only if the corresponding paths are "consecutive" in G. We prove that every path graph can serve as a center of some path graph. Moreover, we show that the class of centers of path graphs is strictly larger than the class of path graphs.