Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm)
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi · 2022
DOI: 10.34312/euler.v10i1.15177 ↗Kurz gefasst
Fachartikel in der Zeitschrift Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi, 2022. Verfasst von Nisky Imansyah Yahya und 5 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Yahya, N. I., Mamonto, K. A., Nurwan, N., Yahya, L., Wungguli, D., & Nashar, L. O. (2022). Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm). Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi. https://doi.org/10.34312/euler.v10i1.15177
Vancouver
Yahya NI, Mamonto KA, Nurwan N, Yahya L, Wungguli D, Nashar LO. Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm). Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi. 2022. doi:10.34312/euler.v10i1.15177
BibTeX
@article{Yahya2022,
author = {Yahya, Nisky Imansyah and Mamonto, Karina Anselia and Nurwan, Nurwan and Yahya, Lailany and Wungguli, Djihad and Nashar, La Ode},
title = {Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm)},
journal = {Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi},
year = {2022},
doi = {10.34312/euler.v10i1.15177}
}
EUVIMED