In a graph G there is one and only one path between every pair of vertices…
2009
In a graph G there is one and only one path between every pair of vertices then G is a
- A.
Path
- B.
Walk
- C.
Tree
- D.
Circuit
Attempted by 69 students.
Show answer & explanation
Correct answer: C
A graph where there is exactly one path between every pair of vertices is called a tree. This property implies the graph is connected and contains no cycles.
A video solution is available for this question — log in and enroll to watch it.