@Shaik Masthan sir, in this example https://gateoverflow.in/3548/gate2006-it-9 Arjun sir said "In tree degree is for outgoing edges only, and hence each degree corresponds to an edge" that means we have to count 0 for leaves
by this definition i am getting answer as 9 but answer given is 18.
is there any default case??
@Peeyush Pandey Same doubt here!
Let d_{1}, d_{2, }...d_{n} be a degree sequence, then
$\sum_{k=1}^{n}$ d_{k} = 2*(n-1) , where n = number of vertices, IFF the given graph is a tree.
So, sum of degrees = 2*(10-1)
= 18
Feedback for next edition (if ever there's...