Definition:Digraph/Symmetric Digraph
< Definition:Digraph(Redirected from Definition:Symmetric Digraph)
Jump to navigation
Jump to search
Definition
Let $D = \struct {V, E}$ be a digraph such that the relation $E$ in $D$ is symmetric.
Then $D$ is called a symmetric digraph.
It follows from the definition of a (simple) graph that a symmetric digraph is in fact the same thing as an undirected graph.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.5$: Directed Graphs as Mathematical Models