Hands-On Mathematics for Deep Learning

Tree graphs

Tree graphs are types of graphs that, as the name suggests, have a tree-like structure. They are undirected and do not have any loops. They also have a rather interesting property, referred to as connectedness, where we can find a path to any node on the graph from any other node.

In the following diagram, we can see what a tree graph looks like:

As you can see, the graph starts at one node (the root node) and ends with leaf nodes. In between, they branch out to form smaller sub-trees. An interesting property is that a tree graph with n nodes has n-1 edges.