Go backward to ExampleGo up to TopGo 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:

GandG' are isomorphic : <=>Gis directed graph /\G' is directed graph /\existsf:f:V->^{iso(E, E')}V'whereV=G_{0},E=G_{1},V' =G'_{0},E' =G'_{1}.

*Different graphs may have same structure.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000