Last Updated：2025/11/29
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.
See correct answer
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.
音声機能が動作しない場合はこちらをご確認ください
Edit Histories（0）
Source Sentence
ハスラー・ウィットニーの定理は、2つの連結グラフが辺のグラフ（ライン・グラフ）が同型であるときに限り元のグラフも同型であると述べており、唯一の例外として3頂点の完全グラフと星型の完全二部グラフK1,3は同型ではないにもかかわらず、どちらも辺のグラフがK3になることが挙げられます。
