{"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI. Rosa, On certain valuations of the vertices of a graph, Theory of Graph (1967) 349-355. 5.\tHarary. F- Graph Theory \u2013 Addison Wesley \u2013mass reading (1972) 6.\tGallian J.A \u2013A dynamic survey of graph labeling of some graphs combinatorics 14 (2007). 7.\tStrong edge graceful labeling for some graphs accepted for publication in Bulletin of pure and Applied science. 8.\tS.M. Lee, Y.C. Pan and M.C. Tsai, On vertex graceful (p, p+1) graph (2008) 65-78. 9.\tLo. S- on edge graceful labeling of graphs, Congressus Numerantium 50 (1985). 10.\tJ. Gross and J. Yellen, Graph theory and its application, (1999)"]}

The concept of a graph labeling is an active area of research in graph theory which has rigorous applications in coding theory, communication networks, optimal circuits layouts and graph decomposition problems.Graph labeling were first introduced in the late 1960s and have been motivated by practical problems. In the intervening years variety of graph labeling techniques have been studied and the subject is growing exponentially.