Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

(a) Draw the directed graph representing the relation \(\left( {\begin{array}{*{20}{l}}1&0&1\\0&1&0\\1&0&1\end{array}} \right)\).

(b) Draw the directed graph representing the relation \(\left( {\begin{array}{*{20}{l}}0&1&0\\0&1&0\\0&1&0\end{array}} \right)\).

(c) Draw the directed graph representing the relation \(\left( {\begin{array}{*{20}{l}}1&1&1\\1&0&1\\1&1&1\end{array}} \right)\).

Short Answer

Expert verified

(a) The graph represented by the relation \(\left( {\begin{array}{*{20}{l}}1&0&1\\0&1&0\\1&0&1\end{array}} \right)\) is

(b) The graph represented by the relation \(\left( {\begin{array}{*{20}{l}}0&1&0\\0&1&0\\0&1&0\end{array}} \right)\) is

(c) The graph represented by the relation \(\left( {\begin{array}{*{20}{l}}1&1&1\\1&0&1\\1&1&1\end{array}} \right)\) is

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

The given relations are \(\left( {\begin{array}{*{20}{l}}1&0&1\\0&1&0\\1&0&1\end{array}} \right)\), \(\left( {\begin{array}{*{20}{l}}0&1&0\\0&1&0\\0&1&0\end{array}} \right)\) and \(\left( {\begin{array}{*{20}{l}}1&1&1\\1&0&1\\1&1&1\end{array}} \right)\).

02

Concept used

A relation\({\rm{R}}\)from\(A = \left\{ {{a_1},{a_2}, \ldots ,{a_m}} \right\}\)to\(B = \left\{ {{b_1},{b_2}, \ldots ,{b_n}} \right\}\)can be represented by the matrix\({M_R} = \left( {{m_{ij}}} \right)\), where\({m_{ij}} = \left\{ {\begin{array}{*{20}{l}}{1{\rm{ if }}\left( {{a_i},{b_j}} \right) \in R}\\{0{\rm{ if }}\left( {{a_i},{b_j}} \right) \notin R}\end{array}} \right.\)

The relation\({\rm{R}}\)on a set\({\rm{A}}\)can be represented by a directed graph which has the elements of\({\rm{A}}\)as its vertices and the ordered pairs\((a,b)\), where\((a,b) \in R\), as edges.

03

Draw the directed graph represented by the relation \(\left( {\begin{array}{*{20}{l}}1&0&1\\0&1&0\\1&0&1\end{array}} \right)\)

(a)

The given matrix is \(\left( {\begin{array}{*{20}{l}}1&0&1\\0&1&0\\1&0&1\end{array}} \right)\).

The relation is on the set \(\{ 1,2,3\} \), thus draw three points (one point for 1, one point for 2, one point for 3).

All elements on the main diagonal are 1, which means that draw a loop at each point.

The only other nonzero elements are \({a_{13}}\) and \({a_{31}}\) which means that draw an arrow from point 1 to point 3 and an arrow from point 3 to point 1 in figure 1 as follows:

Figure 1

04

Draw the directed graph represented by the relation \(\left( {\begin{array}{*{20}{l}}0&1&0\\0&1&0\\0&1&0\end{array}} \right)\)

(b)

The given matrix is \(\left( {\begin{array}{*{20}{l}}0&1&0\\0&1&0\\0&1&0\end{array}} \right)\).

The relation is on the set \(\{ 1,2,3\} \), thus draw three points (one point for 1, one point for 2, one point for 3).

The only nonzero element on the main diagonal is \({a_{22}}\), which means that draw a loop at point 2.

The other nonzero elements are \({a_{12}}\) and \({a_{32}}\) which means that draw an arrow from point 1 to point 2 and an arrow from point 3 to point 2 in figure 2 as follows:

Figure 2

05

Draw the directed graph represented by the relation \(\left( {\begin{array}{*{20}{l}}1&1&1\\1&0&1\\1&1&1\end{array}} \right)\)

(c)

The given matrix is \(\left( {\begin{array}{*{20}{l}}1&1&1\\1&0&1\\1&1&1\end{array}} \right)\).

The relation is on the set \(\{ 1,2,3\} \), thus draw three points (one point for 1, one point for 2, one point for 3).

The only non-zero element on the main diagonal are \({a_{11}}\) and \({a_{33}}\), which means that draw a loop at point 1 and at point 3.

The other nonzero elements are \({a_{12}},{a_{13}},{a_{21}},{a_{23}},{a_{31}},{a_{32}}\).

For each of the non-zero elements \({a_{ij}}\), draw an arrow from point \(i\) to point \(j\) in figure 3 as follows:

Figure 3

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

(a)To find the number of relations on the set \(\{ a,b,c,d\} \).

(b)To find the number of relations on the set \(\{ a,b,c,d\} \) contain the pair \((a,a)\).

List the triples in the relation\(\{ (a,b,c)|a,b\;{\bf{and}}\;\;c\,{\bf{are}}{\rm{ }}{\bf{integers}}{\rm{ }}{\bf{with}}\;0 < a < b < c < 5\} \).

Adapt Algorithm 1 to find the reflexive closure of the transitive closure of a relation on a set with \(n\) elements.

Exercises 34โ€“37 deal with these relations on the set of real numbers:

\({R_1} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a > b} \right\},\)the โ€œgreater thanโ€ relation,

\({R_2} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ge b} \right\},\)the โ€œgreater than or equal toโ€ relation,

\({R_3} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a < b} \right\},\)the โ€œless thanโ€ relation,

\({R_4} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \le b} \right\},\)the โ€œless than or equal toโ€ relation,

\({R_5} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a = b} \right\},\)the โ€œequal toโ€ relation,

\({R_6} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ne b} \right\},\)the โ€œunequal toโ€ relation.

36. Find

(a) \({R_1}^\circ {R_1}\).

(b) \({R_1}^\circ {R_2}\).

(c) \({R_1}^\circ {R_3}\).

(d) \({R_1}^\circ {R_4}\).

(e) \({R_1}^\circ {R_5}\).

(f) \({R_1}^\circ {R_6}\).

(g) \({R_2}^\circ {R_3}\).

(h) \({R_3}^\circ {R_3}\).

What is the covering relation of the partial ordering \(\{ (a,b)\mid a\) divides \(b\} \) on \(\{ 1,2,3,4,6,12\} \).

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free