Go backward to Example
Go up to Top
Go forward to Example
Definition: Two graphs are isomorphic if there exists a bijection between the nodes of the two graphs that preserves the edge structure:
G and G' are isomorphic : <=> G is directed graph /\ G' is directed graph /\ exists f: f: V ->iso(E, E') V' where V = G0, E = G1, V' = G'0, E' = G'1.
Different graphs may have same structure.