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 pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

Use Me  ?

New searches
Data-structure-with-C-10CS35-unit-8-->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 this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this

Loading...


Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!