<![CDATA[Whitney’s Theorem states that every connected graph, different from K3 or K1,3, is uniquely determined by its line graph. The graphs K1,3 and K3 have isomorphic line graphs. We provide an analogue of Whitney’s Theorem for line graphs of multi-graphs. There are two obvious choices for the definition of a line graph of a multi-graph. A 1-line graph of a multi-graph is the graph with as vertices the edges of the multi-graph, and two edges adjacent if and only if there is a unique vertex which is on both edges. The ≥ 1-line graph of a multi-graph is the graph on the edges of the multi-graph, where two edges are adjacent if and only if there is at least one vertex which is on both edges. We extend Whitney’s Theorem to both classes of line graphs of multi-graphs, and show that most multi-graphs are uniquely determined by their line graph. Moreover, we present an algorithm to determine for a given graph Γ, if possible, a multi-graph with Γ as line graph.]]>
Copyrights © 2026
