Open AccessRainbow Coloring of Three New Graph Classes
Author(s) -
Ketut Queena Fredlina,
A. N. M. Salman,
I. Gede Putu Krisna Julihara,
Komang Tri Werthi,
Ni Luh Putu Ning Septyarini Putri Astawa
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1783/1/012033
Subject(s) - rainbow , combinatorics , edge coloring , graph coloring , complete coloring , fractional coloring , mathematics , discrete mathematics , graph power , graph , computer science , line graph , physics , optics
Let G be a simple, finite, and connected graph. A path in an edge colored graph is said a rainbow path, if no two edges on the path have the same color. The graph G is called a rainbow-connected, if any two vertices are connected by a rainbow path. An edge-coloring of such G is rainbow coloring. The rainbow connection number rc(G) of G is the smallest number of colors needed in order to make G rainbow connected. In this paper, we introduce three new graph classes, namely tunjung graphs, sandat graphs, and jempiring graphs. We determine the rainbow connection number of the graphs.