There are 6 towns {A, B, C, D, E, F} with the following one way street relation {(A, B), (A, C), (B, D), (C, B), (D, C), (D, F), (E, C), (E, F)}. Show all pairs of distinct towns that are reachable from one another in both directions.

There are 6 towns {A, B, C, D, E, F} with the following one way street relation {(A, B), (A, C), (B, D), (C, B), (D, C), (D, F), (E, C), (E, F)}. Show all pairs of distinct towns that are reachable from one another in both directions.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Specifically part d please
1) Define the well-ordering property
You create a general AI (artificial intelligence) and want to teach him "friendship" as a relation on a set of people. You define some rules for this friendship relation. These are your four laws of robotic friendships: 1. "Everyone is friend of him or herself". 2. "Not everyone is friend with everyone". 3. "The enemy of my enemy is my friend" (here "enemy" just means "not friend"). 4. "The enemy of my friend is my enemy." a) Can the following directed graph represent the above "friendship" relation on a set of 2 people? Justify your answer. Alice Bob b) Is the defined "friendship" relation reflexive? Justify your answer (explain, in English). c) Is the defined "friendship" relation symmetric? Justify your answer (explain, in English). d) Is the defined "friendship" relation transitive? Justify your answer (explain, in English).
2. Let A = {1,2, 3}, B = {4, 5, 6}, C = {7,8, 9}. Consider the relations R from A to B, S from B to C, and T on A. R = {(1, 5), (2, 4), (1, 6)} S = {(4, 8), (5, 7), (6, 8), (6, 9)} Т 3 {(1,2), (2, 3), (3, 1), (1, 1), (2, 2), (3, 3)} Find the following relations (a) Find the compositions Ro S, T o R, T o T. (b) Find the matrices MR, Ms, MT, MTOT, MTOR and MRos of the respective relations R, S, т, То Т, То R, and Ro S.
Choose the answer
Let X=\{a,b,c,d,e,f\}X={a,b,c,d,e,f} and SS be the relation on XX defined by S = \{ (a,a), (a,b), (a,c),S={(a,a),(a,b),(a,c), (a,d), (a,e), (a,f),(a,d),(a,e),(a,f), (b,b), (b,d), (b,e),(b,b),(b,d),(b,e), (b,f), (c,c), (c,d),(b,f),(c,c),(c,d), (c,e), (c,f), (d,d),(c,e),(c,f),(d,d), (d,e), (d,f), (e,e), (f,f) \}(d,e),(d,f),(e,e),(f,f)}. Is SS a partial order? If so, draw its Hasse diagram. If not, give an example showing why.
If R = {(1, 2), (1, 4), (2, 3). (3, 1), (4, 2)}, what is the symmetric closure of R? O {(1, 2), (2, 1), (1, 4), (4, 1), (2, 3), (3, 2), (3, 1), (1, 3), (4, 2), (2, 4)} O {(1, 1), (1, 2), (1, 4), (2, 2), (2, 3), (3, 1). (3, 3), (4, 2), (4, 4)} O {(1, 2), (1, 4), (2, 3), (3, 1), (4, 2)} O {(1, 1), (1, 2), (1, 3), (1, 4), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1). (3, 2). (3, 3), (3, 4), (4. 1), (4, 2), (4, 3), (4, 4)}
VIII.1. Let A = {1,2, 3, 4} and let R, S, T and U be the following relations: R= {(1,3), (3, 2), (2, 1), (4, 4)}, S = {(2,1), (3, 3), (4, 2)}, T = {(4,1), (4, 2), (3, 1), (3, 2), (1, 2)}, U = {(x, y) | x > y}. (a) For each of R, S, T and U determine whether they are functional, reflexive, symmetric, anti-symmetric or transitive. Explain your answer in each case, showing why your answer is correct. (b) What is the transitive closure of R? (c) Explain why R", the transitive closure of R, is an equivalence relation. De- scribe the equivalence classes E, into which the relation partitions the set A. VIII.2. Prove or give a counterexample to the following statement: for any relation R both R and RoR always have the same transitive closure. VIII.3. Is there a mistake in the following proof that any transitive and symmetric relation Ris reflexive? If so, what is it? Let a Rb. By symmetry, bRa. By transitivity, if aRb and bRa, then aRa. This proves reflexivity. VIII.4. Determine for the…
7. Which graph corresponds to the function * Ax) = Vx+ 2 - 3 %3D 2 Option 1 Option 2 2. Option 3 Option 4
{(а, 1), (ь, 3), (с, 4), (а, 1), (а, 2)} dan Rz {(w, 2), (w, 4), (y, 1), (z, 4)}. Determine Given two relations R1 R1 x R2.
Let P={1.2,3,4,12,36} and the relation set R={(1,1) ,(2,2),(3,3),(4,4),(12,12),(36,36),(1,2),(1,3),(1,4),(1,12),(1,36),(2,4)(2,12),(2,36),(3,12),(3,26),(4,12),(4,36)}. Show that (P,R) is a poser. Represent the relation using the diagraph and then draw the Hasse diagram.