Figure 25
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–3 and 2–3 edges are assigned as wrapped in the +c direction and the 2–4 edge in the −c direction, its corresponding adjacency matrix and edge subsets, (c) the resultant chain graph, (d) an untangled version of this chain graph. (e) The directed proto-graph produced by omitting redundant unwrappings involving vertex 3 in (b), its corresponding adjacency matrix and edge subsets, and (f) the resultant chain graph which is non-isomorphic with the chain graph in (c). (g) The directed proto-graph in which the 2–4 edge is assigned as wrapped in the −c direction and the 3–4 edge is assigned as wrapped in the +c direction, its corresponding adjacency matrix and edge subsets, (h) the resultant chain graph, and (i) an untangled version of this chain graph. Note the chain graphs in (h) and (i) are isomorphic with the chain graphs in (c) and (d). Legend as in Figs. 7 and 21. |