DOI: https://doi.org/10.14710/jfma.v6i2.18228

THE L(2,1)-LABELING OF MONGOLIAN TENT, LOBSTER, TRIANGULAR SNAKE, AND KAYAK PADDLE GRAPH

*Lisa Damayanti Ningrum  -  Mathematics Department, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia
Ahmad Muchlas Abrar  -  Mathematics Department, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung,, Indonesia

Citation Format:
Abstract

Let G = (V,E) be a simple graph. L(2, 1)−labeling defined as a function
f : V (G) → N0 such that, x and y are two adjacent vertices in V, then if x and
y are adjacent to each other, |f(y) − f(x)| ≥ 2 and if x and y have the distance 2,
|f(y) − f(x)| ≥ 1. The L(2, 1)-labeling number of G, called λ2,1(G), is the smallest
numbermof G. In this paper, we will further discuss the L(2, 1)-labeling of mongolian
tent, lobster, triangular snake, and kayak paddle.

Keywords: L(2,1)-Labeling, mongolian tent, lobster, triangular snake, kayak paddle.

 

Fulltext View|Download
Keywords: L(2,1)-Labeling; Mongolian Tent; Lobster, Triangular Snake; Kayak Paddle

Article Metrics:

Article Info
Section: FUNDAMENTAL MATHEMATICS AND APPLICATIONS
Language : EN
Recent articles
THE CHEMICAL TOPOLOGICAL GRAPH ASSOCIATED WITH THE NILPOTENT GRAPH OF A MODULO RING OF PRIME POWER ORDER MIXTURE PURIFICATION MODEL WITH CASCADING TANK CONFIGURATION PRIME LABELING OF SOME WEB GRAPHS WITHOUT CENTER More recent articles
  1. J. R. Griggs and R. K. Yeh, “Labelling graphs with a condition at distance 2,” SIAM Journal on Discrete Mathematics, vol. 5, no. 4, pp. 586–595, 1992
  2. P. Lv, B. Zhang, and Z. Duan, “Improved upper bound on the l (2, 1)-labeling of cartesian sum of graphs,” Mathematical Modelling and Applied Computing (MMAC), vol. 7, no. 1, pp. 1–8, 2016
  3. S. Vaidya, P. Vihol, N. Dani, and D. Bantva, “L(2,1)-labeling in the context of some graph operations,” Journal of Mathematics Research, vol. 2, 07 2010
  4. P. K. Jha, S. Klavˇzar, and A. Vesel, “L (2, 1)-labeling of direct product of paths and cycles,” Discrete Applied Mathematics, vol. 145, no. 2, pp. 317–325, 2005
  5. S. Paul, M. Pal, and A. Pal, “L (2, 1)-labeling of interval graphs,” Journal of Applied Mathematics and Computing, vol. 49, pp. 419–432, 2015
  6. I. A. Umam, I. Halikin, M. Fatekurohman et al., “L (2, 1) labeling of lollipop and pen-dulum graphs,” in International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021). Atlantis Press, 2022, pp. 44–47
  7. Z. Shao and A. Vesel, “-labeling of the strong product of paths and cycles,” The Scientific World Journal, vol. 2014, 2014
  8. G. J. Chang and D. Kuo, “The l(2,1)-labeling problem on graphs,” SIAM Journal on Dis-crete Mathematics, vol. 9, no. 2, pp. 309–316, 1996
  9. B. M. Kim, B. C. Song, and Y. Rho, “L (2, 1)-labellings for direct products of a triangle and a cycle,” International Journal of Computer Mathematics, vol. 90, no. 3, pp. 475–482, 2013
  10. F. Bonomo and M. R. Cerioli, “On the l (2, 1)-labelling of block graphs,” International Journal of Computer Mathematics, vol. 88, no. 3, pp. 468–475, 2011
  11. Z. Shao and R. K. Yeh, “The l (2, 1)-labeling and operations of graphs,” IEEE Transac-tions on Circuits and Systems I: Regular Papers, vol. 52, no. 3, pp. 668–671, 2005
  12. Z. Shao, R. K. Yeh, K. K. Poon, and W. C. Shiu, “The l (2, 1)-labeling of k1, n-free graphs and its applications,” Applied Mathematics Letters, vol. 21, no. 11, pp. 1188–1193, 2008
  13. A. Lum, “Upper bound on l(2,1)-labelling number of graphs with maximum degree δ,” 2007

Last update:

No citation recorded.

Last update:

No citation recorded.