Category:Definitions/Undirected Graphs

From ProofWiki
Jump to navigation Jump to search

This category contains definitions related to Undirected Graphs.
Related results can be found in Category:Undirected Graphs.


An undirected graph is a graph whose edge set considered as a relation is symmetric.

That is, if $G$ is an undirected graph and $e = u v$ is an edge in $G$, then $v u$ is also an edge in $G$.

In other words, if you can "go from $u$ to $v$", you can also "go from $v$ to $u$".