Question

Let S = {n ∈ N | 1 ≤ n < 6} and R = {(m,...

Let S = {n ∈ N | 1 ≤ n < 6} and R = {(m, n) ∈ S × S | m ≡ n mod 3}

a. List all numbers of S.

b. List all ordered pairs in R.

c. Does R satisfy any of the following properties: (R), (AR), (S), (AS), and/or (T)?

d. Draw the digraph D presenting the relation R where S are the vertices, and R determines the directed edges.

e. Give each edge in the digraph G a name, then construct a table for the function γ : E(G) → V (G) × V (G).

f. Give a closed path of length 1, 2, 3, and 4. (vertices may repeat here)

g. Give a cycle of length ≥ 1, if it exists in G. (vertices may not repeat here)

h. Is the digraph G acyclic? (Example 3, pg 102)

i. How many loops (closed paths of the form vivi) does digraph G have?

j. Give the converse relation R←.

k. Give the matrix representation of R←.

l. Does R← satisfy any of the following properties: (R), (AR), (S), (AS), and/or (T)?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

est S={nen/ een co} and R= {(min) e sxs I mem mod 3} @ S= {1,2,3,4,5) ), (2,2), (3,3), (4,4), (5,5), (1,4),(4,1), (2,5), (5,2O G G G GG Scanned with CamScanner

Add a comment
Know the answer?
Add Answer to:
Let S = {n ∈ N | 1 ≤ n < 6} and R = {(m,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Let G = (V, E) be a directed acyclic graph with n vertices and m edges....

    Let G = (V, E) be a directed acyclic graph with n vertices and m edges. Give an O(n + m) time algorithm that determines if G contains a directed path that touches every vertex in G exactly once. The graph G is given by its adjacency list representation.

  • Problem 1: Dynamic Programming in DAG Let G(V,E), |V| = n, be a directed acyclic graph...

    Problem 1: Dynamic Programming in DAG Let G(V,E), |V| = n, be a directed acyclic graph presented in adjacency list representation, where the vertices are labelled with numbers in the set {1, . . . , n}, and where (i, j) is and edge inplies i < j. Suppose also that each vertex has a positive value vi, 1 ≤ i ≤ n. Define the value of a path as the sum of the values of the vertices belonging to...

  • Consider the following four problems: Bin Packing: Given n items with positive integer sizes s1,s2,...,sn, a...

    Consider the following four problems: Bin Packing: Given n items with positive integer sizes s1,s2,...,sn, a capacity C for bins and a positive integer k, is it possible to pack the n items using at most k bins? Partition: Given a set S of n integers, is it possible to partition S into two subsets S1 and S2 so that the sum of the integers in S1 is equal to the sum of the integers in S2? Longest Path: Given...

  • I. Let each of R, S, and T be binary relations on N2 as defined here: R-[<m, n EN nis the smallest prime number greater than or equal to m] S -[< m, n> EN* nis the greatest prime number less...

    I. Let each of R, S, and T be binary relations on N2 as defined here: R-[<m, n EN nis the smallest prime number greater than or equal to m] S -[< m, n> EN* nis the greatest prime number less than or equal to m] (a) Which (if any) of these binary relations is a (unary) function? (b) Which (if any) of these binary relations is an injection? (c) Which (if any) of these binary relations is a surjection?...

  • Let us denote the volume and the surface area of an n-dimensional sphere of adius R as V(OR)-VR a...

    We were unable to transcribe this imageLet us denote the volume and the surface area of an n-dimensional sphere of adius R as V(OR)-VR and S(R)-S.),respectively (a) Find the relation between V(0) and S 1) (b) Calculate the Gaussian integral 3. (c) Calculate the same integral in spherical coordinates in terms of the gamma function re)-e'd (d) Obtain the closed forms of S,,(1) and V(1) (e) Calculate r5) and S.,0), p.(1) for n-1, 2, 3. (40 points) Let us denote...

  • 4. Let S be the set of continuous function f: [0;1) ! R. Let R be...

    4. Let S be the set of continuous function f: [0;1) ! R. Let R be the relation defined on S by (f; g) 2 Rif(x) is O(g(x)). (a) Is R reflexive? (b) Is R antisymmetric? (c) is R symmetric? (d) is R transitive? Explain your answer in details. Use the definition of big-O to justify your answer if you think R has a certain property or give a counter example if you think R does not have a certain...

  • 1. Let A= {0,1}2 U... U{0,1}5 and let < be the order on A defined by...

    1. Let A= {0,1}2 U... U{0,1}5 and let < be the order on A defined by (s, t) E< if and only if s is a prefix of t. (We consider a word to be a prefix of itself.) (a) Find all minimal elements in A. (Recall that an element x is minimal if there does not exist y E A with y < x.) (b) Are 010 and 01101 comparable? 2. Give an example of a total order on...

  • Exercise 5.12. Let n∈N and S={0,1,...,n−1}, and suppose that P({s}) = 1/n for each s∈S. Let...

    Exercise 5.12. Let n∈N and S={0,1,...,n−1}, and suppose that P({s}) = 1/n for each s∈S. Let X:S→R be the random variable defined by X(s) =s. i) Find a closed form formula for MX(z), which does not use sigma notation or any other iterative notation. (ii) Calculate E[X]. (iii) Calculate Var[X].

  • 2. Let n 2 3, and G D2n e,r,r2,... ,r"-1,s, sr, sr2,..., sr-'), the dihedral group with 2n ele- 3...

    2. Let n 2 3, and G D2n e,r,r2,... ,r"-1,s, sr, sr2,..., sr-'), the dihedral group with 2n ele- 3, ST, ST,..,ST ments. We let R-(r) denote the subgroup consisting of all rotations. (a) Show that, if M is a subgroup of R, and is in GR, then the union M UrM is a subgroup of G. Here xM-{rm with m in M) (b) Now take n- 12 and M (). How many distinct subgroups does the construction in (a)...

  • probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R =...

    probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R = R(,y) on S is a statement about pairs (x,y) of elements of S. For r,y ES, I is related to y notation: Ry) if R(x,y) is true. A relation Ris: Reflexive if for any I ES, R. Symmetric if for any ry ES, Ry implies y Rr. Transitive if for any r.y.ES, Ry and yRimply R. An equivalence relation is a reflexive, symmetric and...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT