The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+4 votes
1.6k views

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?

  1. a and b
  2. b and c
  3. a and c
  4. a, b,and c
asked in DS by Veteran (96.1k points)
recategorized by | 1.6k views
0

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"

+2

n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., n from here.

0
if this was the case then what is in this question take any random values like 1,50, 24,  345, 1000
0

Alternative Solution

0
How to solve such questions

1 Answer

+5 votes
Best answer

grecefull

D is ans

answered by Veteran (61.4k points)
selected by
0
how a  graceful in ur diagram diff of 3-2=1 and so is 4-3=1
0
now it is.
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,541 questions
54,083 answers
187,206 comments
70,992 users