Bipartite Graphs on Data Structure and Algorithms related Questions and Answers - Page 4

Question 31 : A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
1. 100
2. 140
3. 80
4. 20
View Answer   Discuss with Members

Question 34 : A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
1. n
2. n/2
3. n/4
4. data insufficient
View Answer   Discuss with Members

Question 35 : A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
1. Number of vertices in U=Number of vertices in V
2. Number of vertices in U not equal to number of vertices in V
3. Number of vertices in U always greater than the number of vertices in V
4. Nothing can be said
View Answer   Discuss with Members

Question 36 : Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
1. Number of vertices in U = Number of vertices in V
2. Sum of degrees of vertices in U = Sum of degrees of vertices in V
3. Number of vertices in U > Number of vertices in V
4. Nothing can be said
View Answer   Discuss with Members


View 31 - 36 of 36 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter