Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
Karina Anselia Mamonto
Departement of Mathematics, Universitas Negeri Gorontalo
Computer Science & IT Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm) Nisky Imansyah Yahya; Karina Anselia Mamonto; Nurwan Nurwan; Lailany Yahya; Djihad Wungguli; La Ode Nashar
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 10 Issue 1 June 2022
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v10i1.15177

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.
Co-Authors Djihad Wungguli La Ode Nashar Lailany Yahya NISKY IMANSYAH YAHYA Nurwan Nurwan