Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Indrawati Lihawa; Sumarno Ismail; Isran K Hasan; Lailany Yahya; Salmun K Nasib; Nisky Imansyah Yahya

doi:10.34312/jjom.v4i1.11826

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya

Abstract

Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph. Graph operation is a method used to create a new graph by combining two graphs. Therefore, this research uses corona product operation to form rainbow-vertex connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) & (P3 Pm,2). The results of this study obtain that the theorem of rainbow vertex-connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) & (P3 Pm,2) for 3 <= m <= 7 are rvc (G) = 2m & rvc (G) = 2.

Keywords

Rainbow Vertex Connection; Corona Operation; Prism Graph; Path Graph

Full Text:

PDF

References

S. Fitrianda, L. Yulianti, and Narwen, “Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf Tangga yang Diperumum,” J. Mat. UNAND, vol. 7, no. 1, pp. 136–142, 2018.

E. Wijayanti, D. Dafik, and E. Oktavianingtyas, “Analisis Dua Koneksi Pelangi pada Graf Hasil Operasi Perkalian Kartesian Graf Kipas F(1,3) dan Graf Lingkaran Cn serta Kaitannya dengan Keterampilan Berpikir Tingkat Tinggi,” J. KadikmA, vol. 9, no. 1, pp. 1–8, 2018.

E. R. Nengsih A, D. Welyyanti, and E. Effendi, “Bilangan Kromatik Lokasi pada Graf Prisma Berekor,” Jurnal Matematika UNAND, vol. 8, no. 1, p. 56, jul 2019, doi: http://dx.doi.org/10.25077/jmu.8.1.56-61.2019.

A. Y. Harsya, I. H. Agustin, and Dafik, “Pewarnaan Titik Pada Operasi Graf Sikel dengan Graf Lintasan,” in Posding Semin. Mat. dan Pendidik. Mat. FMIPA UNEJ, Jember, 2014.

G. H. Medika, “Rainbow Conection pada Beberapa Graf,” Jurnal Matematika UNAND, vol. 2, no. 2, p. 17, jun 2013, doi: http://dx.doi.org/10.25077/jmu.2.2.17-25.2013.

A. Maulani, “Bilangan Keterhubungan Pelangi Dan Keterhubungan Pelangi Kuat Pada Beberapa Kelas Graf Korona,” STATMAT : JURNAL STATISTIKA DAN MATEMATIKA, vol. 1, no. 1, pp. 117–130, feb 2019, doi: http://dx.doi.org/10.32493/sm.v1i1.2378.

Dafik, Slamin, and A. Muharromah, “On the (Strong) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product,” Journal of Physics: Conference Series, vol. 1008, p. 012055, apr 2018, doi: http://dx.doi.org/10.1088/1742-6596/1008/1/012055.

Dafik, I. H. Agustin, A. Fajariyato, and R. Alfarisi, “On the rainbow coloring for some graph operations,” in AIP Conf. Proc., 2016, p. 020004, doi: http://dx.doi.org/10.1063/1.4940805.

A. Nastiti and D. Dafik, “Rainbow Connection Number of Special Graph and Its Operations,” in Pros. Semin. Mat. dan Pendidik., 2014, pp. 1–5.

G. Chartrand, G. L. Johns, K. A. McKeon, and P. Zhang, “Rainbow connection in graphs,” Mathematica Bohemica, vol. 133, no. 1, pp. 85–98, 2008, doi: http://dx.doi.org/10.21136/MB.2008.133947.

D. Dellamonica Jr., C. Magnant, and D. M. Martin, “Rainbow paths,” Discrete Mathematics, vol. 310, no. 4, pp. 774–781, feb 2010, doi: http://dx.doi.org/10.1016/j.disc.2009.09.010.

R. H. Yandera, Y. Irene, and W. Aribowo, “Rainbow Connection Number on Amalgamation of General Prism Graph,” InPrime: Indonesian Journal of Pure and Applied Mathematics, vol. 1, no. 1, pp. 40–47, dec 2019, doi: http://dx.doi.org/10.15408/inprime.v1i1.12732.

D. A. Fauziah, Dafik, I. H. Agustin, and R. Alfarisi, “The rainbow vertex connection number of edge corona product graphs,” IOP Conference Series: Earth and Environmental Science, vol.

, p. 012020, apr 2019, doi: http://dx.doi.org/10.1088/1755-1315/243/1/012020.

A. F. Akadji, M. R. Katili, S. K. Nasib, and N. I. Yahya, “Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4)),” Desimal J. Mat., vol. 4, no. 2, pp. 123–132, 2021.

C. A. P. Noor, L. Yahya, S. K. Nasib, and N. I. Yahya, “Bilangan Terhubung Pelangi pada Graf Salju (Snm),” Journal of Fundamental Mathematics and Applications (JFMA), vol. 4, no. 1, pp. 29–44, jul 2021, doi: http://dx.doi.org/10.14710/jfma.v4i1.9035.

H. Fransiskus Fran, Afriantini, “Pewarnaan Simpul, Sisi, Wilayah pada Graf dan Penerapannya,” Bimaster : Buletin Ilmiah Matematika, Statistika dan Terapannya, vol. 8, no. 4, pp. 773–782, oct 2019, doi: http://dx.doi.org/10.26418/bbimst.v8i4.36037.

DOI: https://doi.org/10.34312/jjom.v4i1.11826