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+
Originally Posted by alexandrabel90 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?
nope...so you get a tree with 3 vertices rigth
View Tag Cloud