Fig. 1: Tree graph. | npj Quantum Information

Fig. 1: Tree graph.

From: Entanglement transitivity problems

Fig. 1

A tree graph is any undirected acyclic graph such that a unique path connects any two vertices. Graph a and b are the only two nonisomorphic trees with (n − 1) edges for n = 4. Graph c is not a tree because it is disconnected and has a cycle.

Back to article page