Figure 23
For vertex connectivity 2V23V2, (a) a proto-graph [identical to that in Fig. 20(a)] and the corresponding vertex and edge subsets, (b) the directed proto-graph in which the 1–2, 1–3, 2–4 and 3–4 edges are assigned as wrapped in the +c direction and the 2–3 edge is assigned as wrapped in the −c direction, and its corresponding adjacency matrix, and (c) the resultant chain graph. (d) The directed proto-graph produced by omitting redundant unwrappings involving vertex 1 in (b), and its corresponding adjacency matrix and edge subsets, and (e) the resultant chain graph. Note that the chain graph in (e) is isomorphic with the chain graph in (c). Legend as in Figs. 7 and 21. |