1.

Every complete bipartite graph must not be _______(a) planar graph(b) line graph(c) complete graph(d) subgraphI got this question in an interview for job.Asked question is from Bipartite Graphs topic in chapter Graphs of Discrete Mathematics

Answer»

Right OPTION is (C) COMPLETE GRAPH

Easy explanation: The below bipartite graph is not a complete graph as there is no edge between A-B, B-C, C-D, C-Q, P-Q, Q-R, Q-D and so it is not a complete graph.



Discussion

No Comment Found

Related InterviewSolutions