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

 62. A graph with all vertices having equal degree is known as a __________ a. Multi Graph b. Regular Graph c. Simple Graph d. Complete Graph

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

 64. The number of elements in the adjacency matrix of a graph having 7 vertices is __________ a. 7 b. 14 c. 36 d. 49

 65. What would be the number of zeros in the adjacency matrix of the given graph? a. 10 b. 6 c. 16 d. 0

 66. Adjacency matrix of all graphs are symmetric. a. False b. True c. May be d. Can't say

 67. 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)