Let T be a tree of order n. Show that the size of the complement of T (T bar) is the same as the size of K(n-1) Thanks
Follow Math Help Forum on Facebook and Google+
Originally Posted by zhupolongjoe Let T be a tree of order n. Show that the size of the complement of T (T bar) is the same as the size of K(n-1) If is a tree with vertices the you know that has edges. The complement has edges. The graph has edges.
View Tag Cloud