Isomorphisms ofP3-graphs
Xueliang Li · Journal of Graph Theory · 1996
For graphs G and G′ with minimum degree at least 3 and satisfying one of three other conditions, we prove that any isomorphism from the P3-graph P3(G) onto P3(G′) can be induced by a (vertex-) isomorphism of G onto G′. This in some sense can be viewed as a counterpart with respect to P3-graphs for Whitney's result on line graphs. © 1996 John Wiley & Sons, Inc.