Limits of iteratd H-line graphs Original Research Article

For a connected graph H on at least three vetices, the H-line graph HL(G) of a graph G is the graph whose vertices correspond to the edges of G, and two vertices of HL(G) are adjacent if the corresponding edges of G are adjacent and lie in a common copy of H in G. We determine the length of the sequence {HLk(G)} when H = Kn and show that KnL(G) is eulerian. A class of limits of such sequences for arbitrary H is characterized.