previous up next
Go backward to Adjacency Matrix
Go up to Top
Go forward to Example
RISC-Linz logo

Undirected Graph

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

G is undirected graph : <=>
   exists V, E:
      G = <V, E>,
      E subset V x V,
      E is symmetric on V.

Special kind of directed graph.

Author: Wolfgang Schreiner
Last Modification: January 26, 2000

previous up next