view article

Figure 22
For vertex connectivity 2V23V2, (a) a proto-graph [identical to that in Fig. 20[link](a)] for the matrix-element combination (10 × 1) and the corresponding vertex and edge subsets, (b) the directed proto-graph in which the 2–3 edge is assigned as wrapped in the −c direction and the corresponding adjacency matrix and edge subsets, and (c) the resultant chain graph. (d) The directed proto-graph in which the 1–2 and 1–3 edges have been assigned as wrapped in the +c direction and the 2–3 edge in the −c direction, and the corresponding adjacency matrix and edge subsets, and (e) the resultant chain graph. (f) The directed proto-graph in which the 2–3 and 1–2 edges have been assigned as wrapped in the −c direction and the 1–3 edge in the +c direction, and the corresponding adjacency matrix and edge subsets, (g) the resultant chain graph, and (h) an untangled version of this chain graph. Note that the chain graph in (e) is isomorphic with the chain graph in (c) as unwrappings involving vertex 1 in (d) are redundant. Legend as in Fig. 21[link].

Journal logoFOUNDATIONS
ADVANCES
ISSN: 2053-2733
Follow Acta Cryst. A
Sign up for e-alerts
Follow Acta Cryst. on Twitter
Follow us on facebook
Sign up for RSS feeds