A simple graph with n vertices and k components can have almost ..........number of edges
Answers
Answered by
0
(n-k)(n-k+1) 2 edges
Similar questions