Top 350+ Solved Discrete Mathematics MCQ Questions Answer
Q. In a the vertex set and the edge set are finite sets.
a. finite graph
b. bipartite graph
c. infinite graph
d. connected graph
Q. If G is the forest with 54 vertices and 17 connected components, G has total number of edges.
a. 38
b. 37
c. 17/54 d
d. 17/53
Q. If each and every vertex in G has degree at most 23 then G can have a vertex colouring of
a. 24
b. 23 c) 176
c. d
d. 54
Q. Triangle free graphs have the property of clique number is
a. less than 2
b. equal to 2
c. greater than 3
d. more than 10
Q. Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called
a. subgraph
b. tree
c. hamiltonian cycle
d. grid
Q. G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is
a. complete bipartite graph
b. hamiltonian cycle
c. regular graph
d. euler graph
Q. is the maximum number of edges in an acyclic undirected graph with k vertices.
a. k-1
b. k2
c. 2k+3
d. k3+4
Q. The minimum number of edges in a connected cyclic graph on n vertices is
a. n – 1
b. n
c. 2n+3
d. n+1
Q. The maximum number of edges in a 8- node undirected graph without self loops is
a. 45
b. 61
c. 28
d. 17
Q. Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between and
a. n-1 and n+1
b. v and k
c. k+1 and v-k
d. k-1 and v-1