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?

Printable View

- April 25th 2011, 06:27 AMalexandrabel90tree
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? - April 25th 2011, 06:42 AMPlato
- April 25th 2011, 06:56 AMalexandrabel90
nope...so you get a tree with 3 vertices rigth