Undirected Graph

Definition

An undirected graph is a Graph in which edges are unordered pairs of vertices. In an undirected graph, an edge between vertices $u$ and $v$ is denoted $(u,v)$ or $\{u,v\}$, and the relationship is symmetric: $(u,v)=(v,u)$.

Properties

In an undirected graph, if there is an edge between vertices $u$ and $v$, both vertices are Adjacent to each other.

See Also

• Graph
• Directed Graph
• Simple Graph