Data Structures & Algorithms Multiple Choice Questions on “Complete Bipartite Graph”.
1. 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
Answer: b
Clarification: 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.
2. Which graph is also known as biclique? Answer: b 3. Which term defines all the complete bipartite graph that are trees? Answer: d 4. How many edges does a n vertex triangle free graph contains? Answer: c 5. Which graph is used to define the claw free graph? Answer: b 6. What is testing of a complete bipartite subgraph in a bipartite graph problem called? Answer: d 7. Which graph cannot contain K3, 3 as a minor of graph? 8. Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph? Answer: d 9. Which complete graph is not present in minor of Outer Planar Graph? Answer: c 10. Is every complete bipartite graph a Moore Graph. Answer: a 11. What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value? Answer: b 12. Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph? Answer: d 13. What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value? Answer: b 14. Is it true that every complete bipartite graph is a modular graph. Answer: a 15. How many spanning trees does a complete bipartite graph contain?
a) Histogram
b) Complete Bipartite
c) Cartesian
d) Tree
Clarification: 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.
a) Symmetric
b) Anti – Symmetric
c) Circular
d) Stars
Clarification: 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.
a) n2
b) n2 + 2
c) n2 / 4
d) n3
Clarification: 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.
a) Bipartite Graph
b) Claw Graph
c) Star Graph
d) Cartesian Graph
Clarification: 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.
a) P Problem
b) P-Complete Problem
c) NP Problem
d) NP-Complete Problem
Clarification: NP stands for nondeterministic polynomial time. In a bipartite graph, the testing of a complete bipartite subgraph in a bipartite graph is an NP-Complete Problem.
a) Planar Graph
b) Outer Planar Graph
c) Non Planar Graph
d) Inner Planar Graph
Answer: a
Clarification: Minor graph is formed by deleting certain number of edges from a graph or by deleting certain number off vertices from a graph. Hence Planar graph cannot contain K3, 3 as a minor graph.
a) (nm)1/2
b) (-nm)1/2
c) 0
d) nm
Clarification: The adjacency matrix is a square matrix that is used to represent a finite graph. Therefore, the Eigen values for the complete bipartite graph is found to be (nm)1/2, (-nm)1/2, 0.
a) K3, 3
b) K3, 1
c) K3, 2
d) K1, 1
Clarification: Minor graph is formed by deleting certain number of edges from a graph or by deleting certain number off vertices from a graph. Hence Outer Planar graph cannot contain K3, 2 as a minor graph.
a) True
b) False
Clarification: In graph theory, Moore graph is defined as a regular graph that has a degree d and diameter k. therefore, every complete bipartite graph is a Moore Graph.
a) 1
b) n + m – 2
c) 0
d) 2
Clarification: The adjacency matrix is a square matrix that is used to represent a finite graph. The multiplicity of the adjacency matrix off complete bipartite graph with Eigen Value 0 is n + m – 2.
a) n + m
b) n
c) 0
d) n*m
Clarification: The laplacian matrix is used to represent a finite graph in the mathematical field of Graph Theory. Therefore, the Eigen values for the complete bipartite graph is found to be n + m, n, m, 0.
a) 1
b) m-1
c) n-1
d) 0
Clarification: The laplacian matrix is used to represent a finite graph in the mathematical field of Graph Theory. The multiplicity of the laplacian matrix of complete bipartite graph with Eigen Value n is m-1.
a) True
b) False
Clarification: Yes, the modular graph in graph theory is defined as an undirected graph in which all three vertices have at least one median vertex. So all complete bipartite graph is called modular graph.
a) nm
b) mn-1 * nn-1
c) 1
d) 0
Answer: b
Clarification: 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 * nn-1 spanning trees for a complete bipartite graph.