Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm)

Abstract

An Octa-Chain graph (OCm) is a graph formed by modifying the cycle graph C8 by adding an edge connecting the midpoints in C8. The minimum number of colors used to color the vertices in a graph so that every two vertices have a rainbow path is called the rainbow vertex-connected number denoted by rvc (G). While the minimum number of colors used to color the vertices in a graph so that every two vertices are always connected by a rainbow path is called a strong rainbow vertex connected number and is denoted by srvc (G). This study aims to determine the rainbow vertex-connected number (rvc) and the strong rainbow-vertex-connected number (srvc) in the Octa-Chain graph (OCm). The results obtained from this research are the rainbow vertex-connected number rvc (OCm)=2m and the strong rainbow-vertex-connected number srvc (OCm)=2m.

Bilangan Terhubung Pelangi pada Graf Ferris Wheel (Fw_n)

“…Pewarnaan Graf merupakan penambahan warna pada elemen sebuah Graf itu sendiri (Taha et al, 2021). Selanjutnya Pewarnaan graf membuat cabang ilmu teori graf semakin berkembang dan menemukan topik baru yaitu pewarnaan pelangi (Krivelevich, M. dan Yuster, 2014).…”