Question: In a graph if e=[u, v], Then u and v are called
Given Answer: D
Suggestion for Correct Answer: A B C D
Question: A connected graph T without any cycles is called
Question: In a graph if e=(u, v) means
Question: . If every node u in G is adjacent to every other node v in G, A graph is said to be
Given Answer: B
Question: Identify the correct problem for multistage graph from the list given below.
Given Answer: A
Question: . Identify the correct problem for multistage graph from the list given below.
Question: From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
Question: Minimum number of spanning tree in a connected graph is
Given Answer: C
Question: Find the odd out
Question: The minimum number of edges required to create a cyclic graph of n vertices is
191 Points
54 Points
53 Points
52 Points
49 Points