Hi so i am preparing for my algorithms class exam and this question is the second last one in my text book with graphs, and i am not too sure how to obtain an algorithm that is just O(m+n).

 

 

a) Prove that every connected graph G=(V,E) has a node v∈V such that removing v and all its adjacent edges will not disconnect G.

 

(b) For a given connected graph G=(V,E), design an O(n+m)-time algorithm to find such a node.

 

 

 

I have understood that i need to take a case such as say for nodes v,w there is a node in between the path from v to w such that if v - x - w is the path, and x is removed, the graph is still connected. Anyone have any ideas?

 

TIA.

 

 

 

 

 

Edited September 26, 201213 yr by AlanTuring

Your questions are very simple and easy to solve ...

 

question a talks about the case of having a graph made of two sub-graphs which are only connected through 1 edge, where nodes on its sides are considered critical

 

question b is not simple, but to find that critical node, you have to go over all nodes in the graph, then check if there exist a circuit,

then it's part of a cycle, and breaking it won't disjoint any sub-graph in that graph by removing this node

 

note: you have to check for all edges connected to every node, if there exist a node that has no circuit, then it's a critical node

Edited October 31, 201213 yr by khaled