Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona

Authors

  • Riduan Yusuf Universitas Muslim Nusantara, Indonesia
  • Fitria Puspa Dewi Universitas Muslim Nusantara, Indonesia
  • Firmansyah Universitas Muslim Nusantara, Indonesia
  • Abdul Mujib Universitas Muslim Nusantara, Indonesia

DOI:

https://doi.org/10.31316/jderivat.v9i2.3780

Abstract

For example  is a chromatic number with the smallest integer so that the graph  has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring. Graph coloring is a special case of graph labeling. Labeling here means, giving color to the points at a certain limit so that no two vertices have the same color. This study aims to calculate the chromatic number in several classes of graphs including , ,  Based on the results of the study, generalization of the chromatic number of the graph class . Class  and for class  for even n and 4 for odd n.

Keywords: graph, graph coloring, chromatic number

For example  is a chromatic number with the smallest integer so that the graph  has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring. Graph coloring is a special case of graph labeling. Labeling here means, giving color to the points at a certain limit so that no two vertices have the same color. This study aims to calculate the chromatic number in several classes of graphs including , ,  Based on the results of the study, generalization of the chromatic number of the graph class . Class  and for class  for even n and 4 for odd n.

Keywords: graph, graph coloring, chromatic number

References

Bondy, J.A., & Murty, U.S.R. (2018). Graph Theory with Applications. (S.Axler & K.A.Ribet, Eds). Springer

Chartrand, G.,dkk. (2002). The Locating-chromatic Number of a Graph. Bull Inst.Combin.Appl, 36 : 89 – 101

Harju, T., (2011). Graph Theory, Departement of Mathematics, Turku, Finland.

Firmansyah, Mujib A. (2020). Bilangan Kromatik Graf Corona Cn ⊙ Cm. 474-480.

Mahardika, F., & Marcos, H. (2017). Penerapan Algoritma Graf Welch Powel pada Penjadwalan Mata Kuliah dan Jadwal Asisten Study Kasus Forum Asisten STMIK Amikom Purwokerto. Jurnal Simetris, 8 (2). 825-832

Munir, R. (2012). Matematika Diskrit Edisi Kelima. Bandung: Informatika

Noviyanti, V.R. (2018). Pewarnaan Sisi r-Dinamis Pada Graf Khusus Serta Graf Operasi Sakel dan Generalisasinya. Jember: Skripsi Universitas Jember

Prasancika, K. W. (2021).Kekuatan Ketidakteraturan Modular Beberapa Graf Padat (Doctoral dissertation, Universitas Pendidikan Ganesha)

Downloads

Published

2022-12-20

Issue

Vol. 9 No. 2 (2022): Jurnal Derivat (Desember 2022)

Section

Articles

Citation Check

License

Copyright (c) 2022 Jurnal Derivat: Jurnal Matematika dan Pendidikan Matematika

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).