0 votes 0 votes Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k. Graph Theory graph-connectivity + – ashutoshsharma asked Sep 14, 2017 ashutoshsharma 394 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Sep 14, 2017 reply Follow Share n = $\frac{k^{2}-k+4}{2}$ ?? 0 votes 0 votes Shubhanshu commented Sep 14, 2017 reply Follow Share @joshi_nitish how you are getting this answer? As if k = 3 then n = 5, we have vertex {A,B,C,D,E} now A is adj to 3 vertex as k = 3 A-B, A-C, A-D now how we will have E as degree 1? 0 votes 0 votes Please log in or register to add a comment.