On the Determination Problem for P 4-Transformation of Graphs

We prove that the P ₄-transformation is one-to-one on the set of graphs with minimum degree at least 3, and if graphs G and G ^' have minimum degree at least 3 then any isomorphism from the P ₄-graph P ₄(G) to the P ₄-graph P ₄(G ^') is induced by a vertex-isomorphism from G to G ^' unless G and G ^' both belong to a special family of graphs. Supported by NSFC, PCSIRT and the “973” program.