Hey there! Sign in to join this conversationNew here? Join for free
x Turn on thread page Beta
    • Thread Starter
    Offline

    9
    ReputationRep:
    What is the difference between a tree and a spanning tree? Please could I have a simple explanation since I cannot understand those online.

    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?
    Offline

    3
    ReputationRep:
    Minimal spanning is where it takes the least amount of distance or any unit to make a tree. There are algorithms for this.
    • Very Important Poster
    Offline

    21
    ReputationRep:
    Very Important Poster
    A tree that has some of the points, but not all of the points, of the original graph is not a spanning tree.
    • Study Helper
    Offline

    15
    Study Helper
    A tree graph is a type of graph, in the same way bipartite graph, and complete graph are. And they refer to the graph as is, that is including all its vertices and edges.

    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.
    • Thread Starter
    Offline

    9
    ReputationRep:
    (Original post by SeanFM)
    A tree that has some of the points, but not all of the points, of the original graph is not a spanning tree.
    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
    • Very Important Poster
    Offline

    21
    ReputationRep:
    Very Important Poster
    (Original post by Mathematicus65)
    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
    See the post above.

    What you've said about connected isn't true (that every node of the original graph must be included).
    • Thread Starter
    Offline

    9
    ReputationRep:
    (Original post by SeanFM)
    See the post above.

    What you've said about connected isn't true (that every node of the original graph must be included).
    Okay thank you, I think I understand
 
 
 
Reply
Submit reply
Turn on thread page Beta
Updated: November 1, 2015
Poll
Do you like carrot cake?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.