Explain that a simple graph is a tree if and only if it haves no simple circuits and addition of an edge connecting two nonadjacent vertices produces a new graph that has exactly one simple circuit (where cir-cuits that contain the same edges are not considered different).