Volume 12 | Number 1 | Year 2014 | Article Id. IJMTT-V12P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V12P502
Let (L, ∧, ∨) be a lattice. A graph G(V,E) is said to be L-magic if there exists a labeling f of the edges of G with the elements of L induces the vertex labeling f+ defined as f+(v) = W u2V f(uv) taken over all edges uv incident at v is a constant and the constant is nothing but the least upper bound of L and also induces another vertex labeling f− defined as f−(v) = V u2V f(uv) is also a constant and the constant is the greatest lower bound of L. A graph is said to be L-magic if it admits L - magic labeling.
[1] J.A.Galian, A dynamic survey graph labeling, Electronic journal of Combinatorics, 17 (2010) DS6.
[2] S.R.Kim and J.Y.Park, On Super edge-magic graphs. Ars combin., 81 (2006) 113-127.
[3] M.C.Kong, S.M.Lee and H.S.H.Sun, On magic strength of graph, Ars Combin., 45, (1997) 193-200.
[4] T.Nicholas, Some labeling problem in graph theory, Ph.D thesis, Manonmaniam Sundaranar University, 2001.
[5] J.K.Sharma, Discrete Mathematics Second Edition
[6] V.L.Stella Arputha Mary, S.Navaneetha Krishnan and A.Nagarajan, Z4p -magic labeling for some special graphs. International Journal of Mathematics and Soft Computing, Vol.3 No.3 (2013), 61-70. 12
[7] V.L.Stella Arputha Mary, S.Navaneetha Krishnan and A.Nagarajan, Z4p -magic labeling for some more special graphs. International journal of Physical Sciences, Ultra Scientist, Vol.25(2)A, (2013), 319-326.
[8] V.L.Stella Arputha Mary, S.Navaneetha Krishnan and A.Nagarajan, Near Z4p -magic labeling. International Journal of Mathematical Archive vol. 4 issue 10, (2013), 266-277.
[9] J.P. Tremblay, R.manohar, Discrete Mathematical Structures with applications to computer science.
V.L.Stella Arputha Mary, S.Navaneethakrishnan, A.Nagarajan, "L- Magic labeling," International Journal of Mathematics Trends and Technology (IJMTT), vol. 12, no. 1, pp. 8-18, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V12P502