Results 1 to 3 of 3

Math Help - tree

  1. #1
    Super Member
    Joined
    Aug 2009
    Posts
    639

    tree

    why is it that when you have a n cycle and one of the edge is removed, you get a tree with (n+1) vertices?

    shouldnt it be n vertices?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,607
    Thanks
    1574
    Awards
    1
    Quote Originally Posted by alexandrabel90 View Post
    why is it that when you have a n cycle and one of the edge is removed, you get a tree with (n+1) vertices?
    shouldnt it be n vertices?
    A triangle is a 3-cycle. Remove one edge do you gain a vertex?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Super Member
    Joined
    Aug 2009
    Posts
    639
    nope...so you get a tree with 3 vertices rigth
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Tree Proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: September 22nd 2010, 07:36 PM
  2. graph + tree
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: July 4th 2010, 11:27 PM
  3. Tree Rings
    Posted in the Algebra Forum
    Replies: 1
    Last Post: June 1st 2010, 01:24 AM
  4. tree diagram
    Posted in the Statistics Forum
    Replies: 5
    Last Post: May 30th 2010, 06:30 AM
  5. Decision tree
    Posted in the Advanced Statistics Forum
    Replies: 0
    Last Post: December 14th 2009, 02:05 AM

Search Tags


/mathhelpforum @mathhelpforum