# Complete Bipartite Graph Multiple choice Questions and Answers (MCQs)

## Complete Bipartite Graph Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 1 Explanation:
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.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which graph is also known as biclique?
 A Histogram B Complete Bipartite C Cartesian D Tree
Question 2 Explanation:
A graph is known as complete bipartite graph if and only if it has all the vertex of first set connected to all the vertex of second set. Complete Bipartite graph is also known as Biclique.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which term defines all the complete bipartite graph that are trees?
 A Symmetric B Anti - Symmetric C Circular D Stars
Question 3 Explanation:
Star is a complete bipartite graph with one internal node and k leaves. Therefore, all complete bipartite graph which is trees are known as stars in graph theory.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many edges does a n vertex triangle free graph contains?
 A n2 B n2 + 2 C n2 / 4 D n3
Question 4 Explanation:
A n vertex triangle free graph contains a total of n2 / 4 number of edges. This is stated by Mantel's Theorem which is a special case in Turan's theorem for r=2.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which graph is used to define the claw free graph?
 A Bipartite Graph B Claw Graph C Star Graph D Cartesian Graph
Question 5 Explanation:
Star is a complete bipartite graph with one internal node and k leaves. Star with three edges is called a claw. Hence this graph is used to define claw free graph.

There are 5 questions to complete.