CONNECTIONS BETWEEN LABELLINGS OF TREES

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of

[1]  Katta G. Murty,et al.  On KΔ , 1986, Discret. Appl. Math..

[2]  B. Devadas Acharya,et al.  Arithmetic graphs , 1990, J. Graph Theory.

[3]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[4]  Bing Yao,et al.  A Note on Strongly Graceful Trees , 2009, Ars Comb..

[5]  Xiangqian Zhou,et al.  A proof to the odd-gracefulness of all lobsters , 2012, Ars Comb..

[6]  Xiangqian Zhou,et al.  Every lobster is odd-elegant , 2013, Inf. Process. Lett..