References
- Aldred, R. E. L, McKay, B. D. (1998). Graceful and harmonious labellings of trees. Bull. Inst. Comb. Appl. 23: 69–72.
- Bange, D. W, Barkauskas, A. E. (1983). Fibonacci graceful graphs. Fib. Quat 21(3): 174–188.
- Bondy, J. A, Murty, U. S. R. (2008). Graph Theory. New York: Springer.
- Daoud, S. N. (2017). Edge odd graceful labeling of some path and cycle related graphs. AKCE Int. J. Graphs Combin 14(2): 178–203.
- Fang, W. A computational approach to the graceful tree conjecture. arXiv:1003.3045v1[cs.DM].
- Gallian, J. A. (2018). A dynamic survey of graph labeling. Electron. J. Combin. 21:1–553.
- Golomb, S. W. (1972). How to number a graph. In: Read, R. C., ed. Graph Theory and Computing. Cambridge, MA: Academic Press, pp. 23–37.
- Kappraff, J. (2002). Beyond Measure: A Guided Tour through Nature, Myth and Number. Chapter 21. Singapore: World Scientific.
- Koh, K. M., Lee, P. Y, Tan, T. (1978). Fibonacci trees. SEA Bull. Math. 2(1): 45–47.
- Lo, S. P. (1985). On edge-graceful labelings of graphs. Congr. Num. 50: 231–241.
- Mahalingam, K, Rajendran, H. P. (2019). On m-bonacci-sum graph. Lecture Notes in Computer Science. CALDAM, pp. 65–76.
- Ringel, G. (1964). Problem 25. Theory of graphs and its applications. Proc. Symposium Smolenice, 1963. Prague, 162.
- Rosa, A. (1966). On certain valuations of the vertices of a graph. In Theory of Graphs. International Symposium Rome, pp. 349–355.
- Wang, T. M, Zhang, G. H. (2018). On edge-graceful labeling and deficiency for regular graphs. AKCE Int. J. Graphs Combin. 15(1): 105–111.