References
- Amaresh Chandra Panda, Debdas Mishra & Rajani Ballav Dash, A class of diameter six trees exhibiting graceful labeling, Journal of Discrete Mathematical Sciences and Cryptography, 19:5-6, (2016), 947-963. doi: 10.1080/09720529.2014.1001591
- M. Babsher, Odd-even gracefulness of splitting graph of some standard graphs, Journal of Discrete Mathematical Sciences and Cryptography, preprint (2020).
- J. A. Gallian, A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, Twentieth edition, December 22, 2017, #DS6.
- S. W. Golomb, How to Number a Graph. In Graph theory and Computing, R. C. Read, ed., New York: Academic Press, (1972), pp.23-27.
- Simon Špacapan, Connectivity of Cartesian products of graphs, Appl. Math. Lett. 21 (2008) 682-685. doi: 10.1016/j.aml.2007.06.010
- A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (Internat. symposium, Rome, July 1966), Gordon and Breach, New York, (1967), 349-355.
- R. Sridevi, S. Navaneethakrishnan, K. Nagarajan, A. Nagarajan, Odd-Even graceful graphs, J. Appl. Math. & Informatics, 30 (2012), 913-923.
- Xing Chen, Xueliang Li, Jianfeng Wang & Nannan Fan, The rainbow connectivity of cartesian product graphs, Journal of Discrete Mathematical Sciences and Cryptography, 22:6, (2019), 901-914. doi: 10.1080/09720529.2019.1614337