edited by
318 views

2 Answers

Best answer
7 votes
7 votes

For a relation to be a partial order relation it must be Reflexive, Anti symmetric and Transitive.
For a relation to be transitive it must follow transitive property.
Transitive property: If a R b and b R c then a R c. Where a R b means a is related to b.

In A graph, a R b and b R d but a is not related to d. It is violating the transitive property. Hence it is not Partial order relation.
In B graph, c R d and d R b but c is not related to b. It also violated the transitive property.
For C graph,
As every vertex has Self loop,  indicating that graph is reflexive.
It is anti symmetric because whenever a R b and b R c imples (a = b).
It is transitive also. because there is no case where x R y and y R z. So x R y and y R z become false. Whenever in P $\rightarrow$ Q , P become false,  P $\rightarrow$ Q become True.
So C graph is Partial order relation. 


Ans: D.

selected by
0 votes
0 votes

A: Transitivity is violated.

B: Transitivity is violated.

C: Reflexive, anti-symmetric, transitive. (self-loops, arrowheads flowing in just one direction, and transitivity isn't violated).

Hence, Option D

Answer:

Related questions

5 votes
5 votes
2 answers
1
Bikram asked May 24, 2017
598 views
Let $S$ be the set $\{1,2,3, \dots ,8\}$. Let $n$ be the number of sets of two non-empty disjoint subsets of $S$. The value of $n$ is _______.
5 votes
5 votes
1 answer
2
Bikram asked May 24, 2017
501 views
Total number of ways we can fill a $4 \times 4$ matrix by $0$ and $1$’s such that every row and column contains odd no of $0$'s and $1$'s is ________.
2 votes
2 votes
1 answer
3
Bikram asked May 24, 2017
231 views
What is the solution of the following recurrence relation? $a_n = 6.a_{n-1} - 9.a_{n-2}$ Base cases : $a_0 = 1$ and $a_1 = 6$.$3n$$2.3n$$3n + n.3n$$3n - n.3n$
2 votes
2 votes
2 answers
4
Bikram asked May 24, 2017
402 views
Which of the above is a lattice :b and ca and db and da only