Graph, Theory, Math, Mathematics, Trees.
are two paths from A to B, one in the original tree and another from A to the new vertex to B, which will create a loop, meaning it is no longer a tree. Here’s a practice problem: How many edges does a tree have given it has n vertices? This is pretty good practice problem you can do on your own.