Home /
Expert Answers /
Advanced Math /
determine-whether-the-relation-with-the-directed-graph-shown-is-an-equivalence-relation-which-of-pa578
(Solved): Determine whether the relation with the directed graph shown is an equivalence relation? Which of ...
Determine whether the relation with the directed graph shown is an equivalence relation?
Which of the following matrix represents the symmetric closure of R?
11 - Derive the boolean expression for the logic circuit shown below:
- If is the source vertex, what is the minimum cost to reach f vertex?
4- Following Karnaugh Map is given to you. Which of the following expression will be obtained after the simplification.
6- Following Karnaugh Map is given to you. Which of the following expression will be obtained after the simplification.
18- Consider the directed graph given below. Which one of the following is true? (Note: Apply Topological Sort Algorithm)
9- Suppose we run Dijkstra's single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
Expert Answer
2) We have to given the graph , from that we have to check whether it is equivalence relation or not .Equivalence relation is Equivalence relation is the relation which is reflexive, symmetric & transitive .(i) First we will check reflexivity.From the graph , there is a path from a to a, b Equivalence relation is the relation which is reflexive, symmetric & transitive .(i) First we will check reflexivity.From the graph , there is a path from a to a, b to b, c Equivalence relation is the relation which is reflexive, symmetric & transitive .(i) First we will check reflexivity.From the graph , there is a path from a to a, b to b, c to c & d to d.Therefore the given graph is reflexive