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

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