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
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
ROBUST PREDICTION INTERVALS FOR INDONESIAN INFLATION: A BIAS-CORRECTED BOOTSTRAP APPROACH Dualitas antara Keterkendalian Lemah dan Keterobservasian Lemah Sistem Linear atas Aljabar Max-Plus Interval THE L(2,1)-LABELING OF MONGOLIAN TENT, LOBSTER, TRIANGULAR SNAKE, AND KAYAK PADDLE GRAPH More recent articles
  1. J. R. Griggs and R. K. Yeh, “Labelling graphs with a condition at distance 2,” SIAM
  2. Journal on Discrete Mathematics, vol. 5, no. 4, pp. 586–595, 1992
  3. P. Lv, B. Zhang, and Z. Duan, “Improved upper bound on the l (2, 1)-labeling of cartesian
  4. sum of graphs,” Mathematical Modelling and Applied Computing (MMAC), vol. 7, no. 1,
  5. pp. 1–8, 2016
  6. S. Vaidya, P. Vihol, N. Dani, and D. Bantva, “L(2,1)-labeling in the context of some graph
  7. operations,” Journal of Mathematics Research, vol. 2, 07 2010
  8. P. K. Jha, S. Klavˇzar, and A. Vesel, “L (2, 1)-labeling of direct product of paths and
  9. cycles,” Discrete Applied Mathematics, vol. 145, no. 2, pp. 317–325, 2005
  10. S. Paul, M. Pal, and A. Pal, “L (2, 1)-labeling of interval graphs,” Journal of Applied
  11. Mathematics and Computing, vol. 49, pp. 419–432, 2015
  12. I. A. Umam, I. Halikin, M. Fatekurohman et al., “L (2, 1) labeling of lollipop and pendulum
  13. graphs,” in International Conference on Mathematics, Geometry, Statistics, and
  14. Computation (IC-MaGeStiC 2021). Atlantis Press, 2022, pp. 44–47
  15. Z. Shao and A. Vesel, “-labeling of the strong product of paths and cycles,” The Scientific
  16. World Journal, vol. 2014, 2014
  17. G. J. Chang and D. Kuo, “The l(2,1)-labeling problem on graphs,” SIAM Journal on Discrete
  18. Mathematics, vol. 9, no. 2, pp. 309–316, 1996
  19. B. M. Kim, B. C. Song, and Y. Rho, “L (2, 1)-labellings for direct products of a triangle
  20. and a cycle,” International Journal of Computer Mathematics, vol. 90, no. 3, pp. 475–482,
  22. F. Bonomo and M. R. Cerioli, “On the l (2, 1)-labelling of block graphs,” International
  23. Journal of Computer Mathematics, vol. 88, no. 3, pp. 468–475, 2011
  24. Y. Sagala et al., “Pelabelan l (2, 1) pada graf sierpi´nski s (n, k),” KARISMATIKA: Kumpulan
  25. Artikel Ilmiah, Informatika, Statistik, Matematika dan Aplikasi, vol. 3, no. 2, 2016
  26. S. Fatimah, I.W. Sudarsana, and S. Musdalifah, “Pelabelan l (2, 1) pada operasi beberapa
  27. kelas graf,” Jurnal Ilmiah Matematika dan Terapan, vol. 13, no. 2, 2016
  28. Z. Shao and R. K. Yeh, “The l (2, 1)-labeling and operations of graphs,” IEEE Transactions
  29. on Circuits and Systems I: Regular Papers, vol. 52, no. 3, pp. 668–671, 2005
  30. Z. Shao, R. K. Yeh, K. K. Poon, andW. C. Shiu, “The l (2, 1)-labeling of k1, n-free graphs
  31. and its applications,” Applied Mathematics Letters, vol. 21, no. 11, pp. 1188–1193, 2008
  32. Z. Shao, R. K. Yeh, and D. Zhang, “The l (2, 1)-labeling on graphs and the frequency
  33. assignment problem,” Applied Mathematics Letters, vol. 21, no. 1, pp. 37–41, 2008
  34. A. Lum, “Upper bound on l(2,1)-labelling number of graphs with maximum degree δ,”

Last update:

No citation recorded.

Last update:

No citation recorded.