Complete Bipartite Graph Multiple choice Questions and Answers (MCQs)

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Complete Bipartite Graph Multiple choice Questions and Answers (MCQs)

Question 6 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is testing of a complete bipartite subgraph in a bipartite graph problem called?
A
P Problem
B
P-Complete Problem
C
NP Problem
D
NP-Complete Problem
Question 6 Explanation: 
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.

Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which graph cannot contain K3, 3 as a minor of graph?
A
Planar Graph
B
Outer Planar Graph
C
Non Planar Graph
D
Inner Planar Graph
Question 7 Explanation: 
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.

Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What are the Eigen values for the adjacency matrix of the complete bipartite graph?
A
(nm)1/2
B
(-nm)1/2
C
0
D
All of the mentioned
Question 8 Explanation: 
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.

Question 9 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which complete graph is not present in minor of Outer Planar Graph?
A
K3, 3
B
K3, 1
C
K3, 2
D
K1, 1
Question 9 Explanation: 
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.

Question 10 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Is every complete bipartite graph a Moore Graph.
A
True
B
False
Question 10 Explanation: 
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.

There are 10 questions to complete.