Tree graph with only two nodes

487 Views Asked by At

New to graph theory and I'm surprised I cannot find any solid clarification on this: For two nodes and one undirected connecting edge, can this be considered a tree graph where both nodes are leaves-- or is the minimum number of nodes on a tree graph three? What about if the connecting edge is directed?

1

There are 1 best solutions below

3
On BEST ANSWER

This is a tree. A tree is a connected, acyclic graph. A single edge certainly satisfies this definition.