51. For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
52. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
53. Number of vertices with odd degrees in a graph having a eulerian walk is . . . . . . . .
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.