Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Dian Setyorini
Universitas Indonesia
Computer Science & IT Decision Sciences, Operations Research & Management

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

Found 1 Documents
Search

 1 
Rainbow connection number of Cm o Pn and Cm o Cn Alfi Maulani; Soya Pradini; Dian Setyorini; Kiki A. Sugeng
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (715.246 KB) | DOI: 10.19184/ijc.2019.3.2.3

Abstract

Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path. For two different vertices, u,v in G, a geodesic path of u-v is the shortest rainbow path of u-v. A strong rainbow coloring is a coloring which any two vertices joined by at least one rainbow geodesic. A rainbow connection number of a graph, denoted by rc(G), is the smallest number of color required for graph G to be said as rainbow connected. The strong rainbow color number, denoted by src(G), is the least number of color which is needed to color every geodesic path in the graph G to be rainbow. In this paper, we will determine  the rainbow connection and strong rainbow connection for Corona Graph Cm o Pn, and Cm o Cn.
Co-Authors Alfi Maulani Kiki A. Sugeng Soya Pradini