ISIPhyNC - Network #12

JSON code of the network

{"nodes":["r","a","b","c","d","1","2"],"edges": [["r","a"],["a","b"],["b","1"],["r","c"],["c","a"],["c","d"],["d","b"],["d","2"]]}

Visualization of the network

r is the root and the leaves are labeled from 1 to 2. Arcs are oriented from the parent to the child.

Classes containing this network or not

Classes which contain this network (with direct proof)

• binary tree-based: Removing the reticulation arcs (c,a) and (d,b) provides a tree this network is based on.
• binary leaf outerplanar: Easy to check.
• binary level-2: Easy to check.
• binary tree-sibling: Reticulation vertex a has a sibling, d, which is not a reticulation vertex and reticulation vertex b has a sibling, 2, which is not a reticulation vertex.
• binary leaf outerplanar: The network can be drawn in a planar way such that leaves 1 and 2 are in the outer face r-a-b-d-c-r.

Classes which do not contain this network (with direct proof)

• binary compressed: Reticulation vertex a is a parent of reticulation vertex b.
• binary nested: Easy to check.

All classes

In the inclusion diagram below, the names of classes containing this network are colored green and the name of the classes not containing it are colored red.