Top 350+ Solved Discrete Mathematics MCQ Questions Answer

From 181 to 195 of 338

Q. If an edge e is said to join the vertices u and v then the vertices u and v are called __.

a. initial vertices

b. terminal vertices

c. ends of e

d. all the above

  • b. terminal vertices

Q. Edges intersect only at their ends are called ________.

a. planar

b. loop

c. link

d. non plannar

  • a. planar

Q. Two vertices which are incident with the common edge are called______________vertices.

a. distinct

b. directed

c. adjacent

d. loops

  • c. adjacent

Q. An edge with identical ends is called _________.

a. complete graph

b. bipartite graph

c. loops

d. link

  • c. loops

Q. An edge with same ends is called ___________.

a. complete graph

b. bipartite graph

c. loops

d. link

  • d. link

Q. In a graph if few edges have directions and few do not have directions then the graph iscalled _________.

a. multi graph

b. directed graph

c. undirected graph

d. mixed graph

  • d. mixed graph

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

a. parallel

b. adjacent

c. incident

d. distinct

  • a. parallel

Q. 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

  • a. bipartite

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

a. square

b. cube

c. single

d. both square and cube

  • b. cube

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

a. incidence

b. adjacency

c. square

d. null

  • a. incidence

Q. 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

  • d. super graph

Q. 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

  • a. disjoint

Q. 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

  • a. number of edges of G incident with v

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

a. path

b. trial

c. walk

d. tour

  • d. tour

Q. If the vertices of a walk W are distinct then W is called __________.

a. path

b. trial

c. walk

d. tour

  • a. path
Subscribe Now

Get All Updates & News