Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2015 Dec – II | Question 5

View Discussion
Improve Article
Save Article
  • Last Updated : 01 May, 2018

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?
5 (3)
(A) (a) and (b)
(B) (b) and (c)
(C) (a) and (c)
(D) (a), (b) and (c)

Answer: (D)

Explanation: 5 (3) (2) (1)
All trees are graceful.
So, option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!