Question
a.
x>=z, where x in S implies z in S, for every element x, y in L
b.
x=y and y<=z, where x, y in S implies z in S, for every element x, y, z in L
c.
x<=y<=z, where x, y in S implies z in S, for every element x, y, z in L
d.
x=y and y>=z, where x, y in S implies z in S, for every element x, y, z in L
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. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if _________
Similar Questions
Discover Related MCQs
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
Q. All closed walks are of ______ length in a bipartite graph.
View solution
Q. Every complete bipartite graph must not be _______
View solution
Q. The spectrum of a graph is _______ if and only if it is _______ graph.
View solution
Q. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______
View solution
Q. If each and every vertex in G has degree at most 23 then G can have a vertex colouring of __________
View solution
Q. Triangle free graphs have the property of clique number is __________
View solution
Q. Berge graph is similar to ______ due to strong perfect graph theorem.
View solution
Q. Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
View solution
Q. A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
View solution
Q. In a ______ the vertex set and the edge set are finite sets.
View solution
Q. If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.
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!
