Question

Define simple digraph and symmetric digraph. Give one example each.

Answer 1

Definition. Let D = ( V , E ) be a digraph such that the relation in is symmetric. Then 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.

HOPE IT HELPS YOU

PLEASE MARK ME AS BRAINLIEST