Question: (a) Let R be the relation on A = {1, 2, 3, 4, 5, 6, 7}, where the directed graph associated with R consists of

(a) Let R be the relation on A = {1, 2, 3, 4, 5, 6, 7}, where the directed graph associated with R consists of the two components, each a directed cycle, shown in Fig. 7.14. Find the smallest integer n > 1, such that Rn = R. What is the smallest value of n > 1 for which the graph of Rn contains some loops? Does it ever happen that the graph of Rn consists of only loops?
(a) Let R be the relation on A = {1,

(b) Answer the same questions from part (a) for the relation R on A = {1, 2, 3, . . . , 9, 10}, if the directed graph associated with R is as shown in Fig. 7.15.

(a) Let R be the relation on A = {1,

(c) Do the results in parts (a) and (b) indicate anything in general?

4 Figure 7.14 6 10 9 Figure 715

Step by Step Solution

3.39 Rating (180 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Let k Z Then R 12k 1 1 2 2 3 3 4 4 5 5 6 6 7 7 and R 12k1 R The smallest value of ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (7849).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!