PELABELAN L(2, 1) PADA GRAF C_m ⊵_e C_n DAN S_m ⊵_o C_n

Authors

DOI:

https://doi.org/10.25077/jmua.13.2.75-90.2024

Keywords:

Graf Bintang, Graf Siklus, Pelabelan L(2, 1)

Abstract

Diberikan $G$ suatu graf. Pelabelan $L(2,1)$ pada suatu graf $G$ merupakan suatu pemetaan $f: V(G)\rightarrow \mathbb{Z}^+\cup\{0\}$ sehingga untuk setiap $u,v\in V(G)$ dengan $d(u,v)=1$ atau $d(u,v)=2$  memenuhi syarat selisih label kedua titik setidaknya $3-d(u,v)$. Jika $k$ merupakan bilangan bulat terbesar yang digunakan, maka pelabelan $L(2,1)$ biasa ditulis dengan pelabelan $k$-$L(2,1)$. Selanjutnya, $\lambda_{2,1}(G)$ merupakan minimum nilai $k$ sehingga terdapat pelabelan $k$-$L(2,1)$ pada $G$. Pada penelitian ini, diberikan nilai $\lambda_{2,1}$ pada graf $C_m\unrhd_e C_n$ dan graf $S_m\unrhd_o C_n$.

Downloads

Download data is not yet available.

Author Biography

Ganesha Lapenangga Putra, Universitas Nusa Cendana

Hello, i am Ganesha, a lecturer at the department of mathematics University of Nusa Cendana

References

Chartrand, G. dan Zhang, P., 2012, A First Course in Graph Theory, Dover Publications, New York

Diestel, R., 2017, Graph Theory, Fifth Ed., Springer, Berlin

Lum, A., 2007, Upper Bounds on the L(2, 1)-Labeling Number of Graphs with Maximum Degree ∆, Whitman College

Saputro, S. W., Mardiana, N., dan Purwasih, I. A., 2017, The Metric Dimension of Comb Product of Graphs, Matematiˇcki Vesnik, Vol. 69(1): 248 – 258

Baˇca, M., Salman, A. N. M., Simanjuntak, R., dan Susanti, B. H., 2020, Rainbow 2-Connectivity of Edge-Comb Product of a Cycle and a Hamiltonian Graph, Proc. Indian Acad. Sci (Math. Sci.), Vol. 130: 1 – 12

Hale, W. K., 1980, Frequency Assignment: Theory and Applications, Proceedings of the IEEE, Vol. 68(12): 1497 – 1514

Marr, A. M., and Wallis, W. D., 2012, Magic Graphs, Second Ed., Birkh¨auser, New York

Griggs, J. R., and Yeh, R. K., 1992, Labeling Graphs with a Condition at Distance 2, SIAM J. Disc. Math., Vol. 5(4): 586 – 595

Shao, Z., Yeh, R. K., Poon, K. K., and Shiu, W. C., 2008, The L(2, 1)-Labeling of K1,n-Free Graphs and Its Applications, Applied Mathematics Letters, Vol. 21(11): 1188 – 1193

Widyaningsih, M., 2017, Pelabelan L(2, 1) pada graf hasil operasi comb antara dua buah graf lingkaran, Skripsi, di UIN Sunan Gunung Djati, tidak diterbitkan

Muharram, F., Pelabelan L(2, 1) pada graf hasil operasi dari graf sikel, Skripsi, di Universitas Diponegoro, tidak diterbitkan

Prasetyo, I. W., 2011, Pelabelan L(2, 1) pada graf cycle, graf star dan graf wheel, Skripsi, di Universitas Sebelas Maret, tidak diterbitkan

Setyo, N., 2012, Rentang minimum pelabelan L(2, 1) untuk graf middle, Skripsi, Universitas Diponegoro, tidak diterbitkan

Miryawati, L., 2010, Pelabelan L(2, 1) pada graf bidang ubin reguler dan graf outer planar, Skripsi, Universitas Diponegoro, tidak diterbitkan

Karimah, L. N., 2016, Pelabelan L(2, 1) pada graf super cycle, Skripsi, UIN Maulana Malik Ibrahim, tidak diterbitkan

Fatimah, S., Sudarsana, I. W., dan Musdalifah, S., 2016, Pelabelan L(2, 1) pada Operasi Beberapa Kelas Graf, Jurnal Ilmiah Matematika dan Terapan, Vol. 13(2): 73 – 84

Sagala, Y. C., 2016, Pelabelan L(2, 1) pada Graf Sierpi´nski S(n, k), KARISMATIKA: Kumpulan Artikel Ilmiah, Informatika, Statistik, Matematika dan Aplikasi, Vol. 3(2): 130 – 139

Noviana, G., 2017, Pelabelan L(2, 1) pada graf hasil operasi comb antara graf lintasan dan graf lingkaran, Skripsi, di UIN Sunan Gunung Djati, tidak diterbitkan

Putri, A. Z. A., 2017, Pelabelan L(2, 1) pada graf ‘hasil operasi comb antara graf lintasan dan graf bintang, Skripsi, di UIN Sunan GUnung Djati, tidak diterbitkan

Umam, I. A., 2021, Pelabelan L(2, 1) pada graf lolipop L(m, n), Skripsi, di Universitas Jember, tidak diterbitkan

Chang, G. J., dan Kuo, D., 1996, The L(2, 1)-Labeling Problem on Graphs, SIAM Journal on Discrete Mathematics, Vol. 9(2): 309 – 316

Paul, S., Pal, M., dan Pal, A., 2015, The L(2, 1)-Labeling of Interval Graphs, Journal of Applied Mathematics and Computing, Vol. 49: 419 – 432

Shao, Z., Yeh, R. K., dan Zhang, D., 2008, The L(2, 1)-labeling on Graphs and The Frequency Assignment Problem, Applied Mathematics Letters, Vol. 21(1): 37 – 41

Wang, W. F., 2006, The L(2, 1)-Labeling of Trees, Discrete Applied Mathematics, Vol. 154(3): 598 – 603

Putra, G. L., 2023, Struktur Aljabar I, Penerbit NEM, Pekalongan

Downloads

Published

30-04-2024

How to Cite

Lamapaha, E., Haning, F. O., & Putra, G. L. (2024). PELABELAN L(2, 1) PADA GRAF C_m ⊵_e C_n DAN S_m ⊵_o C_n. Jurnal Matematika UNAND, 13(2), 75–90. https://doi.org/10.25077/jmua.13.2.75-90.2024

Issue

Vol. 13 No. 2 (2024)

Section

Articles

License

All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 license, users are free to:

  • Share: Copy and redistribute the material in any medium or format.

  • Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.