Question
a.
reflexive, antisymmetric and transitive
b.
reflexive, symmetric
c.
asymmetric, transitive
d.
irreflexive and transitive
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The relation ≤ is a partial order if it is ___________
Similar Questions
Discover Related MCQs
Q. In which of the following relations every pair of elements is comparable?
View solution
Q. In a poset (S, ⪯), if there is no element n∈S with m<n, then which of the following is true?
View solution
Q. In a poset P({v, x, y, z}, ⊆) which of the following is the greatest element?
View solution
Q. Suppose P₁ is a partially ordered class and a cut of P₁ is pair (D, T) of nonempty subclasses of P₁ satisfies which of the following properties?
View solution
Q. Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…, 18}. How many edges are there in G?
View solution
Q. A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______
View solution
Q. In the poset (Z⁺, |) (where Z⁺ is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable?
View solution
Q. If every two elements of a poset are comparable then the poset is called ________
View solution
Q. ______ and _______ are the two binary operations defined for lattices.
View solution
Q. A ________ has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).
View solution
Q. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if _________
View solution
Q. Every poset that is a complete semilattice must always be a _______
View solution
Q. A free semilattice has the _______ property.
View solution
Q. The maximum number of edges in a bipartite graph on 14 vertices is ___________
View solution
Q. In a ______ the degree of each and every vertex is equal.
View solution
Q. The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search.
View solution
Q. The partition V = V₁ ∪ V₂ in a bipartite graph G₁ is called ________
View solution
Q. What is the maximum number of edges in a bipartite graph on 14 vertices?
View solution
Q. In a complete bipartite graph, the intersection of two sub graphs is ______
View solution
Q. Bipartite graphs are used in ________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!