A K- connected graph can be disconnected only it atleast K-____________ is removed.
A) Vertices
B) Edges
C) Connectivity
D) Cut
Answers
Answered by
1
Answer:
edges is right answer.
hope this helps you mate ❇️✌️❇️
follow my top following ❣️
Similar questions