References
- [1] J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008
- [2] W. C. Chen,H.I.Lu, andY.N.Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bull. Math., 21, (1997)
- [3] M.-L. Chia, D. Kuo, H.-Y. Liao, C.-H. Yang, and R. K.Yeh, L(3, 2, 1)-labeling of Graphs, Taiwanese Journal of Mathematics, 15 (6), (2011), 2439-2457
- [4] J. Clippeton, J. Gehrtz, Z. Szaniszlo, and D. Torkornoo, L(3, 2, 1)-labeling of Simple Graphs, VERUM, (2006)
- [5] J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math., 5, (1992), 586-595
- [6] W. K. Hale, Frequency assignment, Theory and application, Proc. IEEE, 68, (1980), 1497-1514
- [7] J.-Z. Liu and Z.-D. Shao,The L(3, 2, 1)-labeling problem on graphs, Mathematica Applicata, 17(4), (2004), 596-602
- [8] M. Murugan, Topics in Graph Theory and Algorithms, Revised Edition, Muthali Publishing House, Chennai, India, 2018
- [9] M. Murugan and M.Suriya, k-number of special family of graphs, International J. Math. Combin., 1, (2020), 77-85
- [10] F. S. Roberts, T -colorings of graphs, Discrete Math., 93, (1991), 229-245
- [11] Z.-D. Shao,The L(3, 2, 1)-labeling problem on graphs, J. Qufu Normal University, 30(3), (2004), 24-28
- [12] S.-C. Shee and Y.-S. Ho, The cordiality of the path-union of n copies of a graph, Discrete Mathematics, 151, (1996), 221-229