Let G be an undirected graph. Let P(x,y) mean that there is a path from vertex…
Let G be an undirected graph. Let P(x,y) mean that there is a path from vertex x to vertex y.
∃x,y,z, ~Px,y⋀~P(x,z)⋀~P(y,z) represents that
- A.
G has at least three connected components
- B.
G has exactly three connected components
- C.
G has at most three connected components
- D.
None of these
Attempted by 19 students.
Sign up free to check your answer
Sign up freeLoading lesson…