The relation R = {(1, 3), (1, 1), (3, 1), (1, 2), (3, 3), (4, 4)} defined on {1, 2, 3, 4} is ____
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. Not reflexive, not symmetric and not transitive
Explanation
(2, 2) is missing (not reflexive). (1, 2) is present without (2, 1) (not symmetric). (3, 1) and (1, 2) are present without (3, 2) (not transitive).More Discrete Structures and Optimization questions
- Let G be a simple undirected graph with n (n > 10) vertices and k connected components. What is the minimum possible number of edges of G?
- The negation of "Some students like hockey" is:
- A relation R is defined on ordered pairs of integers as (x, y) R (u, v) if x < u and y > v. Then R is
- Suppose you are married and you and your partner attend a party with three other married couples. Several handshakes took place. No one sho…
- Consider the following graph with vertices A, B, C, D and edges: A – B, B – C, A – D, B – D, C – D (A, B, C lie in a row; D is below and jo…
- Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices…