Diameter in iterated path graphs (Q5936025)

The path graph \(P_k(G)\) (where \(G\) is a graph and \(k\geq 1\)) was defined as a natural generalization of the line graph of \(G\). The authors study the behavior of \(\text{diam}(P^i_2(G))\) as a function of \(i\), where \(P^i_2(G)\) is the composition \(P_2(P^{i-1}_2(G))\) and \(P^0_2(G)= G\).