Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Indi Izzah Makhfduloh
Universitas Jember
Computer Science & IT Other

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

Found 1 Documents
Search

 1 
Rainbow Connection pada Graf Siput, Graf Tunas Kelapa dan Graf Lotus Indi Izzah Makhfduloh; Dafik Dafik; R Adawiyah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 4, No 1 (2023): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v4i1.91

Abstract

Graph colouring is giving colour to a set of vertices and a set of edges on a graph. The condition for colouring a graph is that each colour is different for each neighbouring graph member. Graph colouring can be done by mapping a different colour to each vertex or edge. Rainbow colouring is part of the rainbow-connected edge colouring, where every graph G has a rainbow path. A rainbow path in graph G is formed if two vertices on graph G do not have the same colour. The minimum number of colours in a rainbow-connected graph is called the rainbow connection number denoted by rc(G). The graphs used in this study are the snail graph (Sn), the coconut shoot graph (CRn,m) and the lotus graph (Lon).
Co-Authors D. Dafik Robiatul Adawiyah