Home / Engineering / Discrete Mathematics MCQs / Page 42

Discrete Mathematics MCQs | Page - 42

Dear candidates you will find MCQ questions of Discrete Mathematics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.43K Points
Coach

Q. 411) An edge with same ends is called ___________.

(A) complete graph
(B) bipartite graph
(C) loops
(D) link
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 412) In a graph if few edges have directions and few do not have directions then the graph is called _________.

(A) multi graph
(B) directed graph
(C) undirected graph
(D) mixed graph
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 413) If two edges have same vertices as its terminal vertices those edges are called ____.

(A) parallel
(B) adjacent
(C) incident
(D) distinct
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 414) Each edge has one end in set X and one end in set Y then the graph (X, Y) is called _____graph.

(A) bipartite
(B) simple
(C) complete
(D) trivial
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 415) The graph defined by the vertices and edges of a __________ is bipartite.

(A) square
(B) cube
(C) single
(D) both square and cube
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 416) To any graph G there corresponds a vertex in a matrix called ________matrix.

(A) incidence
(B) adjacency
(C) square
(D) null
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 417) If H is a sub graph of G then G is a ______ of H.

(A) proper sub grapth
(B) inducted sub graph
(C) spanning subgraph
(D) super graph
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 418) If the graph G1 and G2 has no vertex in common then it is said to be ______.

(A) disjoint
(B) edge disjoint
(C) union
(D) intersection
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 419) The degree of vertex v in G is __________.

(A) number of edges of G incident with v
(B) number of loops in G
(C) number of links in G
(D) number of sub graph in G
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 420) If the edges of a walk W are distinct then W is called _________.

(A) path
(B) trial
(C) walk
(D) tour
View Answer Discuss Share