Graphs isomorphic to their path graphs
Martin Knor, Ľudovít Niepel (2002)
Mathematica Bohemica
Similarity:
We prove that for every number , the -iterated -path graph of is isomorphic to if and only if is a collection of cycles, each of length at least 4. Hence, is isomorphic to if and only if is a collection of cycles, each of length at least 4. Moreover, for we reduce the problem of characterizing graphs such that to graphs without cycles of length exceeding .