Re: [math-fun] Graph Question

Is there a name for the operation which takes one graph to another, such that the points of the new graph are the edges of the original graph, and there is an edge between two such points if their originating edges shared a point? I.e., each edge becomes a point, and a point with valence n becomes C(n,2) edges.

i believe the resulting graph is called the _line_graph_ of the original graph. i do not know if there's a specific term for the *operation* involved. mike