When proving a simple connected graph is a tree if adding an edge between two existing vertices of T creates exactly one cycle, is it sufficient to just remove that edge that created a cycle, then it since that results in a graph with no cycles, therefore it must be a tree graph by definition?
Original statement to prove: Prove a simple connected graph T is a tree if and only if adding an edge between two existing vertices of T creates exactly one cycle.