Solution Found!
On page 102, we defined the binary relation connected on the set of vertices of a
Chapter 3, Problem 3.30(choose chapter or problem)
On page 91, we defined the binary relation “connected” on the set of vertices of a directed graph. Show that this is an equivalence relation (see Exercise 3.29), and conclude that it partitions the vertices into disjoint strongly connected components.
Questions & Answers
QUESTION:
On page 91, we defined the binary relation “connected” on the set of vertices of a directed graph. Show that this is an equivalence relation (see Exercise 3.29), and conclude that it partitions the vertices into disjoint strongly connected components.
ANSWER:Step 1 of 2
In relation, when it satisfies all the three properties such that reflexive, symmetric, and transitive is known as equivalence relation.
A binary relation on a set is said to have the following three properties, when it satisfies the condition:
- Reflexive: If for all
- Symmetric: If implies
- Transitive: If and implies