Undirected Graph

Last updated Nov 1, 2022

Let $V$ be a Set and suppose $E \subset {{v, w} \in \mathcal{P}(V) : v, w \in V, v \neq w}$. Then $(V, E)$ is a Undirected Graph with vertices $v \in V$ and edges $e \in E$.

1. We can Represent an Undirected Graph as a Directed Graph by adding both directions for each edge.

1. Sometimes we say $G$ is an Undirected Graph and refer to its vertices and edges as $V(G)$ and $E(G)$ respectively.