(b) It has at least 2 vertices of degree 1, (n ≥ 2). Proof. (a) is part (c) of previous lemma. k = 1 since T is connnected ...
確定！ 回上一頁
