On the determination problem for \(P_3\)-transformation of graphs (Q2713627)

For a positive integer \(k\), the path graph \(P_k(G)\) of a graph \(G\) is the graph with vertex set formed by all \(k\)-vertex paths in \(G\) and with two vertices being adjacent if and only if the corresponding paths in \(G\) form a \(P_{k+1}\) or a \(C_k\) (this concept was introduced by \textit{H. J. Broersma} and \textit{C. Hoede} [J. Graph Theory 13, No.~4, 427-444 (1989; Zbl 0677.05068)] as a generalization of line graphs). There are known examples of nonisomorphic graphs with isomorphic path graphs (e.g., \(P_3(C_6)\simeq C_6\simeq P_3(S(K_{1,3}))\)). The main result of the paper shows that the \(P_3\)-transformation is one-to-one on all graphs with minimum degree greater than two.