# Definition:Directed Graph/Symmetric Digraph

Let $D = \struct {V, E}$ be a digraph such that the relation $E$ in $D$ is symmetric.
Then $D$ is called a symmetric digraph.