My understanding of a tree is that it is defined to be a connected graph with no cycles.
Whilst a spanning tree is a tree of a connected graph that connects all the nodes in the original graph.
So how can there be a difference between these?
- Study Helper
A spanning tree, is a subgraph, it may, or may not, include all the edges of the original graph. A graph can have several different spanning trees.
Are you sure because my text book defines a tree to be a CONNECTED graph hence every node of the original graph must be included in ANY tree not just spanning trees
What you've said about connected isn't true (that every node of the original graph must be included).