Discrete Structure05 marksDirected graphs for relations
How can we represent a relation using directed graph? Draw a directed graph of the relation R = {(1, 1), (1, 3), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (4, 1)} on the set {1, 2, 3, 4}.
How can we represent a relation using directed graph? Draw a directed graph of the relation R = {(1, 1), (1, 3), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (4, 1)} on the set {1, 2, 3, 4}. [5]
A relation R on a set A can be represented as a directed graph (digraph) where: - Each element of the set A is represented as a node (vertex) - For every ordered pair (a, b) ∈ R, we draw a directed edge (arrow) from node a to node b - If (a, a) ∈ R (i.e., an element is related to itself), we draw...