E-super arithmetic graceful labelling of H_i(m, m), H_i⁽¹⁾ (m, m) and chain of even cycles

[1] B. D. Acharya, S. M. Hedge, Arithmetic graphs, J. Graph Theory, 14 (1990) 275–299. ⇒82 Search in Google Scholar

[2] J. A. Gallian, A dynamic survey of graph labelling, The Electronic Journal of combinatorics, DS6 (2016). ⇒82 Search in Google Scholar

[3] S. W. Golomb, How to number a graph, in Graph Theory and Computing, R. C. Reed (ed) Academic Press, New York (1972) 23–37. ⇒81 Search in Google Scholar

[4] S. M. Hedge, Additively graceful graphs, Mat. Acad. Sci. Lett., 12 (1989) 387–390. ⇒82 Search in Google Scholar

[5] A. Kotzig, A. Rosa Magic valuation of finite graphs, Canad. Math. Bull, 13 (1970) 451–456. ⇒82 Search in Google Scholar

[6] J. A. MacDougall, M. Miller, Slamin, W. D. Walls, Vertex-magic total labelling of graphs, Util. Math. 61 (2002) 3–21. ⇒82 Search in Google Scholar

[7] G. Marimuthu, M. Balakrishnan, Super edge magic graceful graphs, Information Sciences, 287, 10 (2014) 140–151. http://dx.doi.org/10.10162Fj.ins.2014.07.027 ⇒82 Search in Google Scholar

[8] V. Ramachandran, C. Sekar, (1, N)-arithmetic graphs, International Journal of Computers and Applications, Vol. 38, 1 (2016) 55–59. https://doi.org/10.1080/1206212X.2016.1218240 ⇒82 Search in Google Scholar

[9] A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (International Symposium, Rome, July 1966), Gordon and Breach, N.Y and Dunod Paris (1967) 349–355. ⇒81 Search in Google Scholar