Given a connected, undirn undirected connected graph, what is the minimum number of edges that must be added to it to make it 2-vertex-connected, and what are those edges?↵
↵
Is the methodology for this problem similar to the same situation of making a graph 2-edge-connected (adding ceil(numPendants/2) edges)?↵
↵
Please help, and thanks in advance!
↵
Is the methodology for this problem similar to the same situation of making a graph 2-edge-connected (adding ceil(numPendants/2) edges)?↵
↵
Please help, and thanks in advance!