Looking for the meaning or definition of the word Whitney's theorem? Here's what it means.
Proper noun
A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K3, the complete graph on three vertices, and the complete bipartite graph K1,3, which are not isomorphic but both have K3 as their line graph.
