Go backward to Adjacency Matrix
Go up to Top
Go forward to Example
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.