Figure 29
(a) A proto-graph with vertex connectivity 2V23V2, its corresponding adjacency matrix, and (b) the resultant chain graph in which edges 2–3, 3–4 and 2–4 and vertices 2, 3 and 4 form polygonal branches. (c) The directed proto-graph in which the 2–4 edge is assigned as wrapped in the −c direction, and (d) the resultant chain graph which does not contain branches and is non-isomorphic with the chain graph in (b). Legend as in Fig. 7. |