ハスラー・ウィットニーの定理は、2つの連結グラフが辺のグラフ(ライン・グラフ)が同型であるときに限り元のグラフも同型であると述べており、唯一の例外として3頂点の完全グラフと星型の完全二部グラフK1,3は同型ではないにもかかわらず、どちらも辺のグラフがK3になることが挙げられます。
Quizzes for review
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.
Related words
Whitney's theorem
- 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
