References
- G. S. Bloom and D. F. Hsu, On graceful digraphs and a problem in network addressing, Congr. Numer. 35 (1982) 91-103.
- G. S. Bloom and D. F. Hsu, On graceful directed graphs that are computational models of some algebraic systems, in Graph Theory with Applications to Algorithms and Computers, eds. Y. Alavi (Wiley, New York 1985).
- G. S. Bloom and D. F. Hsu, On graceful directed graphs, SIAM J. Alg. Discrete Math. 6 (1985) 519-536. doi: https://doi.org/10.1137/0606051
- J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. Dynamic Surveys (2010) DS6.
- B. Gayathri and V. Vanitha, Directed EdgeGraceful Labeling of the Graph Tt,n,m, International Journal of Engineering Sciences, Advanced Computing and Bio-Technology 1(4) (2010) 170-182.
- B. Gayathri and V. Vanitha, Directed edge - graceful labeling of trees, Elixir Appl. Math. 36 (2011) 3062-3066.
- B. Gayathri and V. Vanitha, Directed edge - graceful labeling of cycle and star related graphs, International Journal of Mathematics and Soft Computing 1(1) (2011) 89-104. doi: https://doi.org/10.26708/IJMSC.2011.1.1.03
- S. Lo, On edgegraceful labelings of graphs, Congr. Numer. 50 (1985) 231-241.
- A. C. Panda, D. Mishra and R. B. Dash, A class of diameter six trees exhibiting graceful labeling, J. Discrete Math. Sci. Cryptogr. 19(5-6) (2016) 947-963. doi: https://doi.org/10.1080/09720529.2014.1001591
- A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, in Internat. Symposium, Rome, July 1966 (Gordon and Breach, N. Y. and Dunod Paris 1967), pp. 349-355.