ISIPhyNC - Network #6

JSON code of the network

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

Visualization of the network

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

Classes containing this network or not

Classes which contain this network (with direct proof)

• binary galled tree: Easy to check.

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

• binary unicyclic: Easy to check.
• binary time-consistent: The redundant arc from r to b makes it impossible to build a time-consistent labeling of the vertices.
• binary distinct-cluster: Vertices r and a both have the same cluster: {1,2,3}

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.