A spanning tree of a graph is a subgraph that connects all nodes using exactly edges, where is the number of nodes. No cycles allowed. If you have nodes, the spanning tree has exactly edges. Add one more edge and you create a cycle.
Remove an edge and the graph becomes disconnected. Think of it as the skeleton of the graph. Minimum edges, maximum connectivity. This is the foundation for understanding MST.