71. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is . . . . . . . .
72. What is the degree sequence of the given HyperGraph, in non-increasing order.
V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}
V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}
73. Given Adjacency matrices determine which of them are PseudoGraphs?
i. {{1,0} {0,1}}
ii. {{0,1}{1,0}}
iii. {{0,0,1}{0,1,0}{1,0,0}}
i. {{1,0} {0,1}}
ii. {{0,1}{1,0}}
iii. {{0,0,1}{0,1,0}{1,0,0}}
74. Time complexity to find if there is an edge between 2 particular vertices is . . . . . . . .
75. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
76. What would be the number of zeros in the adjacency matrix of the given graph?

77. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
78. What would be the DFS traversal of the given Graph?

79. Which of the given statement is true?
80. In which of the following does a Directed Acyclic Word Graph finds its application in?
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.