...
UGC NET CS 2015 Dec- paper-2
October 10, 2023
Nielit Scentist-B [02-12-2018]
October 10, 2023
UGC NET CS 2015 Dec- paper-2
October 10, 2023
Nielit Scentist-B [02-12-2018]
October 10, 2023

UGC NET CS 2015 Dec- paper-2

Question 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 following trees are graceful?
(a)
(b)
(c)
A
(a) and (b)
B
(b) and (c)
C
(a) and (c)
D
(a), (b) and (c)
Question 5 Explanation: 
Above all graphs are graceful.

Correct Answer: D
Question 5 Explanation: 
Above all graphs are graceful.

Leave a Reply

Your email address will not be published. Required fields are marked *