The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
61 views
Let T = (V, E) be a tree and let d(v) be the degree of a vertex. 
Consider following statements: 
(i) P v∈V (2 − d(v)) = 2 
(ii) If T has a vertex of degree m ≥ 2, then it has at least m vertices of degree 1. 
(iii) P v∈V (k − d(v)) = k, for k ≥ 2 | k ∈ Z + Which of the above statements is/are ture:
(A) (i) only  
(B) (i), (ii) only 
(C) (ii) and (iii) only 
(D) (i), (ii) and (iii) only
closed
in Graph Theory by Active (1.2k points)
closed by | 61 views
+1
even doesn't understand the question also.

from where you got this question?
0
Yes i also din't understand the question. The question is from Gatebook test series.
+1
is this exact question? ( can you share the question and solution snapshots which are provided by them? )
0

This is screenshot of question and the answer details are  not provided .
It's okay ! Don't trouble yourself much, May be question is wrongly framed.

+1

@Sandy Sharma

Kiran sir, lectures are very good.

So i hope he didn't mistake in his test series.

It's okay ! Don't trouble yourself much, May be question is wrongly framed.

yes, sometimes it happens.

0
question is beautiful but printing the symbol of ∑ spoils it !

Related questions

+3 votes
0 answers
5
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
50,092 questions
55,239 answers
190,756 comments
85,992 users