Let G = (V, E) be a loop-free connected undirected graph, where V = {a, b, c,

Question:

Let G = (V, E) be a loop-free connected undirected graph, where V = {a, b, c, . . . , h, i, j}. Ordering the vertices alphabetically, the depth-first spanning tree T for G - with a as the root-is given in Fig. 12.45(i). In part (ii) of the figure the ordered pair next to each vertex v provides (lowÊ¹(v), low(v)). Determine the articulation points and the spanning trees for the biconnected components of G.