Data Structure Questions and Answers-Undirected Graph
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is .....
Question 1 Explanation:
There can be at most, n*n edges in an undirected graph.
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
Question 2 Explanation:
Euler's Identity says V - E + R = 1+ number of connected components.
Number of vertices with odd degrees in a graph having a eulerian walk is .....
Can't be predicted
either 0 or 2
Question 3 Explanation:
If the start and end vertices for the path are same the answer would be 0 otherwise 2.
How many of the following statements are correct?
i) All cyclic graphs are complete graphs.
ii) All complete graphs are cyclic graphs.
iii) All paths are bipartite.
iv) All cyclic graphs are bipartite.
v) There are cyclic graphs which are complete.
Question 4 Explanation:
Statements iii) and v) are correct.
All paths and cyclic graphs are bipartite graphs.
Question 5 Explanation:
Only paths and even cycles are bipartite graphs.
There are 5 questions to complete.