Whitney's theorem
Quizzes for review
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.
Whitney's theorem
Whitney's theorem states that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with the single exception that the complete graph on three vertices and the star K1,3 are not isomorphic despite both having K3 as their line graph.
Whitney's theorem states that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with the single exception that the complete graph on three vertices and the star K1,3 are not isomorphic despite both having K3 as their line graph.
English - English
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
