Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
EULER: Volume 10 Issue 1 June 2022

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

Nisky Imansyah Yahya (Departement of Mathematics, Universitas Negeri Gorontalo)
Karina Anselia Mamonto (Departement of Mathematics, Universitas Negeri Gorontalo)
Nurwan Nurwan (Departement of Mathematics, Universitas Negeri Gorontalo)
Lailany Yahya (Departement of Mathematics, Universitas Negeri Gorontalo)
Djihad Wungguli (Departement of Mathematics, Universitas Negeri Gorontalo)
La Ode Nashar (Departement of Statistics, Universitas Negeri Gorontalo)



Article Info

Publish Date
30 Jun 2022

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.

Copyrights © 2022






Journal Info

Abbrev

Euler

Publisher

Subject

Computer Science & IT Mathematics

Description

Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi is a national journal intended as a communication forum for mathematicians and other scientists from many practitioners who use mathematics in the research. Euler disseminates new research results in all areas of mathematics and their ...