4 votes 4 votes A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., 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 and b b and c a and c a, b,and c DS ugcnetcse-dec2015-paper2 data-structures tree + – go_editor asked Aug 3, 2016 • edited Aug 6, 2020 by soujanyareddy13 go_editor 4.0k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply srestha commented Aug 3, 2016 reply Follow Share absolute value is only when a value there is no difference with sign bit. where u got that concept "cannot take value greater than no. of vertex" 0 votes 0 votes Prashant. commented Aug 3, 2016 reply Follow Share n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., n from here. 2 votes 2 votes Prashant. commented Aug 3, 2016 reply Follow Share if this was the case then what is in this question take any random values like 1,50, 24, 345, 1000 0 votes 0 votes smsubham commented Feb 13, 2018 reply Follow Share Alternative Solution 0 votes 0 votes anchitjindal07 commented Aug 1, 2018 reply Follow Share How to solve such questions 0 votes 0 votes rsansiya111 commented Aug 21, 2022 reply Follow Share need proper explanation kindly help 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes D is ans Prashant. answered Aug 3, 2016 • selected Aug 3, 2016 by Prashant. Prashant. comment Share Follow See all 2 Comments See all 2 2 Comments reply Sanjay Sharma commented Aug 3, 2016 reply Follow Share how a graceful in ur diagram diff of 3-2=1 and so is 4-3=1 0 votes 0 votes Prashant. commented Aug 3, 2016 reply Follow Share now it is. 0 votes 0 votes Please log in or register to add a comment.