Top 50+ Solved Non Linear Data Structures - Graphs MCQ Questions Answer
Q. Which of the following statements for a simple graph is correct?
a. Every path is a trail
b. Every trail is a path
c. Every trail is a path as well as every path is a trail
d. Path and trail have no relation
Q. For the given graph(G), which of the following statements is true?
a. G is a complete graph
b. G is not a connected graph
c. The vertex connectivity of the graph is 2
d. none
Q. What is the number of edges present in a complete graph having n vertices?
a. (n*(n+1))/2
b. (n*(n-1))/2
c. n
d. Information given is insufficient
Q. If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is
a. (n*n-n-2*m)/2
b. (n*n+n+2*m)/2
c. (n*n-n-2*m)/2
d. (n*n-n+2*m)/2
Q. Which of the following properties does a simple graph not hold?
a. Must be connected
b. Must be unweighted
c. Must have no loops or multiple edges
d. Must have no multiple edges
Q. What is the maximum number of edges in a bipartite graph having 10 vertices?
a. 24
b. 21
c. 25
d. 16
Q. For a given graph G having v vertices and e edges which is connected and has no cycles, which ofthe following statements is true?
a. v=e
b. v = e+1
c. v + 1 = e
d. v = e-1
Q. For which of the following combinations of the degrees of vertices would the connected graph beeulerian?
a. 1,2,3
b. 2,3,4
c. 2,4,5
d. 1,3,5
Q. A graph with all vertices having equal degree is known as a
a. Multi Graph
b. Regular Graph
c. Simple Graph
d. Complete Graph
Q. Which of the following ways can be used to represent a graph?
a. Adjacency List and Adjacency Matrix
b. Incidence Matrix
c. Adjacency List, Adjacency Matrix as well as Incidence Matrix
d. No way to represent
Q. The number of possible undirected graphs which may have self loops but no multiple edges andhave n vertices is
a. 2((n*(n-1))/2)
b. 2((n*(n+1))/2)
c. 2((n-1)*(n-1))/2)
d. 2((n*n)/2)
Q. Number of vertices with odd degrees in a graph having a eulerian walk is
a. 0
b. Can’t be predicted
c. 2
d. either 0 or 2