Data Structure Questions and Answers-Graph
Click on any option to know the CORRECT ANSWERS
Which of the following statements for a simple graph is correct?
Every path is a trail
Every trail is a path
Every trail is a path as well as every path is a trail
None of the mentioned
Question 1 Explanation:
In a walk if the vertices are distinct it is called a path, whereas if the edges are distinct it is called a trail.
In the given graph identify the cut vertices.
B and E
C and D
A and E
C and B
Question 2 Explanation:
After removing either B or C, the graph becomes disconnected.
For the given graph(G), which of the following statements is true?
G is a complete graph
G is not a connected graph
The vertex connectivity of the graph is 2
The edge connectivity of the graph is 1
Question 3 Explanation:
: After removing vertices B and C, the graph becomes disconnected.
What is the number of edges present in a complete graph having n vertices?
Information given is insufficient
Question 4 Explanation:
Number of ways in which every vertex can be connected to each other is nC2.
The given Graph is regular.
Question 5 Explanation:
In a regular graph, degrees of all the vertices are equal. In the given graph the degree of every vertex is 3.
There are 5 questions to complete.