Go backward to Adjacency MatrixGo up to TopGo forward to Example |

*Definition:*
An *undirected graph* is a directed graph whose
edge relation is symmetric:

Gis undirected graph : <=>existsV,E:G= <V,E>,EsubsetVxV,Eis symmetric onV.

*Special kind of directed graph.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000