Coupon Accepted Successfully!


Cut Vertices And Connectivity


Cut vertex is analogue of a bridge. A vertex v of a graph is called a cut vertex of G if

ω(G – v) > ω(G),

Where ω(G) are number of components in graph G, i.e. a cut vertex breaks a graph into a subgraph having more connected components, then G has


Test Your Skills Now!
Take a Quiz now
Reviewer Name