UGC NET Computer Science Paper 2 5 A tree with n vertices is called graceful if its vertices can be labelled with integers 1 2 n such that the absolute value of the difference of the labels of adjacent vertices are all different Which of the
The eduladder is a community of students, teachers and programmers just interested to make you to pass any exams. So we solve question papers for you.
See Our team
Wondering how we keep quality?
Got question?

Ask Questions

Use Me  ?

New searches
You are here:-->View note-->View question

UGC NET Computer Science Paper 2 5 A tree with n vertices is called graceful if its vertices can be labelled with integers 1 2 n such that the absolute value of the difference of the labels of adjacent vertices are all different Which of the

(A) (a) and (b) 
(B) (b) and (c) 
(C) (a) and (c) 
(D) (a), (b) and (c) 


By:scribed

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about thisDelete|Like|Dislike|


Answers

D

scribed

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about thisOnce you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

You dont have permission to add an answer herePlease see this

Join us to pass any exams easily