Any non-planar graph has K5 or K3,3 as a subgraph. Both these subgraphs are non-planar. K5 has 5 vertices and 10 edges. K3,3 has 6 vertices and 9 edges. Since we are interested in the non-planar with the fewest number of edges, option (B) is the correct choice.
Which of the following graphs has an Eulerian circuit?
data structure mcq questions with answers ,Data Structure Multiple Choice Questions and Answers , Data Structure MCQ with explanation, Data Structure Questions Answers , Data Structure Objective Type Questions Answers, This Section covers multiple choice questions answers in Data Structures that can be used for UGC NET Computer Science, GATE Computer Science , Computer Engineering , PSU , IES , Phd Entrance Exam , Pre Phd Entrance Exam and other competitive Exams. Data structures mcq questions with answers, Data structure using C, Data Structure in C