Results 1 to 2 of 2

Math Help - Spanning Forest

  1. #1
    Junior Member
    Joined
    Oct 2008
    Posts
    35

    Spanning Forest

    For the question below I am getting m+n+c but I am told it is wrong can someone please help

    How many edges must be removed to produce the spanning forest of a graph
    with n vertices, m edges and c connected components?

    Thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    Oct 2008
    Posts
    35
    The only way I can make sense of the m-n+c is that:
    n vertices stay the same for every component of spanning trees.(n)
    There are less edges m in every spanning tree.(m-n)
    Lastly there you union all the components to create a spanning forest.(+c)
    So overall you get m-n+c.
    Is that right?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Forest growth equation -- continue
    Posted in the Differential Equations Forum
    Replies: 0
    Last Post: August 8th 2011, 07:41 PM
  2. [SOLVED] Forest growth equation
    Posted in the Differential Equations Forum
    Replies: 5
    Last Post: July 2nd 2011, 05:55 AM
  3. spanning set
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: October 24th 2010, 11:46 AM
  4. spanning
    Posted in the Advanced Algebra Forum
    Replies: 5
    Last Post: October 3rd 2010, 05:20 AM
  5. Spanning set.
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: December 5th 2009, 06:50 PM

Search Tags


/mathhelpforum @mathhelpforum