edited by
3,907 views
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?

  1. a and b
  2. b and c
  3. a and c
  4. a, b,and c
edited by

1 Answer

Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Aug 8, 2016
3,014 views
The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the minimum degree, is$\theta (\log_n h*t)$$\theta (\log_t n*h)$$\th...
3 votes
3 votes
2 answers
2
go_editor asked Aug 8, 2016
3,876 views
The hash function used in double hashing is of the form:$h(k,i)=(h_1(k)+h_2(k)+i) \: mod \: m$$h(k,i)=(h_1(k)+h_2(k)-i) \: mod \: m$$h(k,i)=(h_1(k)+i \: h_2(k)) \: mod \:...
1 votes
1 votes
1 answer
3
Sankaranarayanan P.N asked Aug 2, 2016
1,723 views
The inorder traversal of the following tree is$2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$$20 \...
1 votes
1 votes
2 answers
4