The Gateway to Computer Science Excellence
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.
in Revision by | 135 views
n = $\frac{k^{2}-k+4}{2}$ ??

@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?

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,430 answers
95,241 users