When is a graph said to be bipartite?(a) If it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B(b) If the graph is connected and it has odd number of vertices(c) If the graph is disconnected(d) If the graph has at least n/2 vertices whose degree is greater than n/2This question was addressed to me by my college professor while I was bunking the class.This question is from Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II

When is a graph said to be bipartite?(a) If it can be divided into two

1.	When is a graph said to be bipartite?(a) If it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B(b) If the graph is connected and it has odd number of vertices(c) If the graph is disconnected(d) If the graph has at least n/2 vertices whose degree is greater than n/2This question was addressed to me by my college professor while I was bunking the class.This question is from Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II
Answer» The correct choice is (a) If it can be DIVIDED into two independent SETS A and B such that each edge CONNECTS a vertex from to A to B For EXPLANATION: A graph is said to be bipartite if it can be divided into two independent sets A and B such that each edge connects a vertex from A to B.

Discussion

No Comment Found

Related InterviewSolutions

What is the chromatic number of compliment of line graph of bipartite graph?(a) 0(b) 1(c) 2(d) 3please answer, I need the answer asap.
How many spanning trees does a complete bipartite graph contain?(a) n^m(b) m^n-1 * n^n-1(c) 1(d) 0I have been asked this question in an online interview.The doubt is from Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II
Is it true that every complete bipartite graph is a modular graph.(a) True(b) FalseThe question was asked by my college director while I was bunking the class.The doubt is from Bipartite Graphs topic in section Bipartite Graphs of Data Structures & Algorithms II
Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?(a) n + m(b) n(c) 0(d) n*mThe question was posed to me in semester exam.My question is based upon Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II
What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value?(a) 1(b) m-1(c) n-1(d) 0I got this question in exam.I want to ask this question from Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II
What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?(a) 1(b) n + m – 2(c) 0(d) 2I have been asked this question during an interview.My question is from Bipartite Graphs in section Bipartite Graphs of Data Structures & Algorithms II
Is every complete bipartite graph a Moore Graph.(a) True(b) FalseThis question was addressed to me by my college professor while I was bunking the class.The question is from Bipartite Graphs in chapter Bipartite Graphs of Data Structures & Algorithms II
Which complete graph is not present in minor of Outer Planar Graph?(a) K3, 3(b) K3, 1(c) K3, 2(d) K1, 1The question was asked in an online interview.This intriguing question comes from Bipartite Graphs topic in chapter Bipartite Graphs of Data Structures & Algorithms II
Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?(a) (nm)^1/2(b) (-nm)^1/2(c) 0(d) nmThis question was addressed to me during an interview.Asked question is from Bipartite Graphs in portion Bipartite Graphs of Data Structures & Algorithms II
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 GraphI had been asked this question in semester exam.Query is from Bipartite Graphs in section Bipartite Graphs of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment