Explore topic-wise MCQs in Discrete Mathematics.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.

1.

A graph is ______ if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.

A. bipartite graph
B. planar graph
C. line graph
D. euler subgraph
Answer» C. line graph
2.

A graph G has the degree of each vertex is 3 say, deg(V) 3 V G such that 3|V| 2|E| and 3|R| 2|E|, then the graph is said to be ________ (R denotes region in the graph)

A. Planner graph
B. Polyhedral graph
C. Homomorphic graph
D. Isomorphic graph
Answer» C. Homomorphic graph