M modulo N Graceful Labeling on Arbitrary Super Subdivision of Ladder Graph
M modulo N Graceful Labeling ASSLG
Keywords:Graceful Labeling, Supersubdivision of ladder graph, arbitrary supersubdivision of ladder graph, M modulo N graceful Labeling, Algorithm of labeling
In this paper, we show that arbitrary super subdivisions of ladder graphs and super subdivisions of ladder graphs are M modulo N graceful Labeling. Furthermore, on the given graph, a C++ programme is used to trace the M modulo N graceful labeling.
Joseph A. Gallian, ”A Dynamic Survey of Graph Labeling,” The electronic journal of Combinatorics, 24th ed, Dec., pp. 1-535, 2021.
A.A.G. Ngurah, A.N.M. Salman, and I.W. Sudarsana, ”On supermagic coverings of fans and ladders,” SUT Journal of Mathematics,
Vol. 46, No. 1, May., pp. 67 - 78, 2010.
G.S. Singh, ”Subdivisions of ladders are arithmetic,” Multidiscplinary Research Review, Vol. 2, pp. 23 - 25, 1992.
S. Sudha and V. Kanniga, ”Arbitrary supersubdivision of helms, centipedes and ladder graphs are graceful,” Math, Sci. International
Research Journal, Vol. 1, No. 3, pp. 860 - 863, 2012.
C. Velmurugan and V. Ramachandran, ”Design and development of algorithm for M modulo N graceful labeling on cycle
and Complete graph,” Advances and Applications in Mathematical Sciences, Vol. 21, No. 5, March., pp. 2283 - 2300, 2022.
Copyright (c) 2023 C .Velmurugan, Ramachandran V
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.