## Thinking Mathematically (6th Edition)

A graph that is connected and has no circuits is called a tree. For such a graph, every edge is a bridge. For such a graph, if there are $n$ vertices, there must be $n-1$ edges.