M

Mr. Dubey • 52.70K Points
Coach 

Q. How many spanning trees does a complete bipartite graph contain?

(A) nm
(B) mn-1 * nn-1
(C) 1
(D) 0
Share
Explanation by: Mr. Dubey 
 spanning tree of a given graph is defined as the subgraph or the tree with all the given vertices but having minimum number of edges. so, there are a total of mn-1

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Main sources of noise pollution are

Q. ... is the program run on a computer when the computer boots up

Q. What is output of below program? int main() { int i,j,count; count=0; for(i=0; i<5; i++); { for(j=0;j<5;j++); { count++; } } printf("%d&quo

Q. A product of the variable and their negation in a formula is called ________.

Q. -------- refers to the process of examining a business situation with the intent of improving it through better procedures and methods.

Q. To access the services of operating system, the interface is provided by the

Q. Within Table Datasheet view, how can you display associated records from another table?

Q. CLSS stands for

Q. Truthfulness with which software satisfies differing system constraints and user needs is

Q. Com in Latin is

Question analytics