whitney's theorem
Word Rarity
Very rare
Frequency: Zipf frequency 2.29 in modern English
29
Scrabble Score
15
Letters
4
Syllables
11
Unique Chars
Meaning
name
A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K₃, the complete graph on three vertices, and the complete bipartite graph K_(1,3), which are not isomorphic but both have K₃ as their line graph.
Example Sentences
- "Whitney's theorem can be extended to hypergraphs."