Diameter in iterated path graphs Original Research Article

If G is a graph, then its path graph, Pk(G), has vertex set identical with the set of paths of length k in G, with two vertices adjacent in Pk(G) if and only if the corresponding paths are ‘consecutive’ in G. We study the behavior of diam(P2i(G)) as a function of i, where P2i(G) is a composition P2(P2i−1(G)), with P20(G)=G.