最終更新日:2025/11/29
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
編集履歴(0)