Help Needed in Graph problem.

Revision en2, by zoro_2278, 2020-09-08 10:02:03

Given an undirected graph with N vertices and M edges. In how many ways we can choose K vertices, such that after removing them, the graph remains still remains connected? I know we can find Articulation points when k=1, but not able to understand what to do for k>1.
1<= N <=50 , N-1<= M <=(N*(N-1)/2) and 0<= k <=N.
Link to question Link

UPD There was a mistake from my side. There was a typo in the question. I have corrected it now.

Tags #graph, #combitorics, #algorithms

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English zoro_2278 2020-09-08 10:02:03 125 Tiny change: 'ing)\n\n** UPD ** There w' -> 'ing)\n\n**UPD** There w'
en1 English zoro_2278 2020-09-07 16:34:35 468 Initial revision (published)