Ungerichteter Graph/Isomorph/Definition

< Ungerichteter Graph < Isomorph

Isomorphe Graphen

Zwei Graphen ${}G=(V,E)$ und ${}H=(W,F)$ heißen isomorph, wenn es einen Graphisomorphismus ${}\varphi \colon G\rightarrow H$ gibt.

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.