81. The graphs G1 and G2 with their incidences matrices given are Isomorphic.
e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1
e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 1
e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1
e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 182. Which of the following symbols represent leaf nodes?
i. Δ
ii. ◊
iii. ∇
iv. T
v. ⊥
i. Δ ii. ◊ iii. ∇ iv. T v. ⊥
83. The given Graph is regular.
84. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?
85. Adjacency matrix of all graphs are symmetric.
86. Consider the following symbols and choose which of the symbols represent nodes having atleast one child?
i. Δ
ii. ◊
iii. ∇
iv. T
v. ⊥
i. Δ ii. ◊ iii. ∇ iv. T v. ⊥
87. All undirected Multigraphs contain eulerian cycles.
88. For the adjacency matrix of a directed graph the row sum is the . . . . . . . . degree and the column sum is the . . . . . . . . degree.
89. In the given graph which edge should be removed to make it a Bipartite Graph?
90. If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.