Tree with i degree vertices (i: 2~k) and n-k+1 leaves (tree) / Graph Theory Prob. #1 10월 17, 2023 by Younghoo Let T be an n-vertex tree having one vertex of each degree i with I:2~k; the remaining n-k+1 vertices are leaves. Determine n in terms of k.