Recent content by Magra2118

  1. M

    Graph Theory: a tree and it's complement proof

    Homework Statement The complement of T' of a tree T with n vertices has [(n-1)(n-2)]/2 edges, for all integers n greater than or equal to 2. Homework Equations Must prove using induction and using Lemma 18.2 which states "any tree that has more than one vertex has at least one vertex of...