Graphs Questions

MCQ bookmark_border

61.

For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

A

v=e

B

v = e+1

C

v + 1 = e

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

62.

For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

A

1,2,3

B

2,3,4

C

2,4,5

D

1,3,5

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

63.

A graph with all vertices having equal degree is known as a __________

A

Multi Graph

B

Regular Graph

C

Simple Graph

D

Complete Graph

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

64.

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

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

65.

The number of elements in the adjacency matrix of a graph having 7 vertices is __________

A

7

B

14

C

36

D

49

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

66.

What would be the number of zeros in the adjacency matrix of the given graph?

A

10

B

6

C

16

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

67.

Adjacency matrix of all graphs are symmetric.

B

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

68.

The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

A

O(V)

B

O(E^2)

C

O

D

O(V^2)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

69.

For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

A

in, out

B

out, in

C

in, total

D

total, out

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

70.

What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

A

(n*(n-1))/2

B

(n*(n+1))/2

C

n*(n-1)

D

n*(n+1)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion