On interchange graphs

I(G) = G. This paper solves this problem for finite connected graphs with loops and parallel edges, extending earlier work on the problem. A loop (an edge whose two ends coincide in a single vertex) is considered adjacent to itself, and hence generates another loop under the / mapping. If two edges of G connect the same two vertices, the corresponding vertices of I(G) are also connected by two distinct edges.