Published September 1, 2018
| Version v1
Journal article
Open
GRACEFUL AND GRACEFUL LABELING OF GRAPHS
Authors/Creators
- 1. Research Scholar, Department of Mathematics, PRIST University, Vallam, Thanjavur, Tamilnadu
- 2. Associate Professor, Department of Mathematics, PRIST University, Vallam, Thanjavur, Tamilnadu
Description
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.
Files
234.pdf
Files
(729.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:4dc9fed8a3854ee3fc8e5da3cfefad73
|
729.2 kB | Preview Download |
Additional details
References
- 1. J. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2. I. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3. Gutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4. I. Rosa, On certain valuations of the vertices of a graph, Theory of Graph (1967) 349-355. 5. Harary. F- Graph Theory – Addison Wesley –mass reading (1972) 6. Gallian J.A –A dynamic survey of graph labeling of some graphs combinatorics 14 (2007). 7. Strong edge graceful labeling for some graphs accepted for publication in Bulletin of pure and Applied science. 8. S.M. Lee, Y.C. Pan and M.C. Tsai, On vertex graceful (p, p+1) graph (2008) 65-78. 9. Lo. S- on edge graceful labeling of graphs, Congressus Numerantium 50 (1985). 10. J. Gross and J. Yellen, Graph theory and its application, (1999)