STQM2103 Discrete Structure 10. Let A = {a,b,c,d,e), R and S are two relations on A as defined below: R = {(a,a), (a,b), (b,a), (b,c), (c,c), (b,d), (e,b)} S= {(b,c), (c,c), (d,b), (d,c), (d,e), (e,b), (e,c), (e,e)} a) Draw the diagraph of R. b) Draw the diagraph of S. c) Find the in-degree and out-degree of all vertices based on diagraph of R. d) Find the associate matric for S.

STQM2103 Discrete Structure 10. Let A = {a,b,c,d,e), R and S are two relations on A as defined below: R = {(a,a), (a,b), (b,a), (b,c), (c,c), (b,d), (e,b)} S= {(b,c), (c,c), (d,b), (d,c), (d,e), (e,b), (e,c), (e,e)} a) Draw the diagraph of R. b) Draw the diagraph of S. c) Find the in-degree and out-degree of all vertices based on diagraph of R. d) Find the associate matric for S.

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter10: Sequences, Series, And Probability

Section10.7: Distinguishable Permutations And Combinations

Problem 16E

See similar textbooks