Graph Theory #Lecture 13#

v is cut point then v is on Every u-w path x is bridge iff x is not on any cycle every graph has at least two points which are not cut points definition of block, connectivity