M

Mr. Dubey • 65.25K Points
Coach 

Q. Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

(A) bipartite
(B) complete bipartite
(C) cartesian
(D) pie
Share
Explanation by: Mr. Dubey 
 the graph is known as bipartite if the graph does not contain any odd length cycle in it. the complete bipartite graph has all the vertex of first set connected to all the vertex of second set.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which one of the following is not a valid state of a thread?

Q. We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

Q. A relation Schema R is in ……….. if it is in 3NF and satisfies an additional constant thatfor every FD X->A. X must be a candid

Q. Select the command in SeleniumIDE used to open a web page using theURL

Q. A company is _single-owner enterprise with approximately 25 employees.

Q. Given the relation Supplier(s_id, p_order, s_name, qty) Given that there is a unique s_name for each s_id and that s_id, p_order is a composite key, f

Q. What was an important feature of the process by which the Mobiphos photograph sharing application (Patel et al., 2009) was evaluated?

Q. The DSS signature uses which hash algorithm?

Q. To join the internet, the computer has to be connected to a

Q. DA stands for:

Question analytics