Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Khairunnisa N. Afifah
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 
Local strong rainbow connection number of corona product between cycle graphs Khairunnisa N. Afifah; Kiki A. Sugeng
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.4

Abstract

A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called d-local strong rainbow coloring. The d-local strong rainbow connection number, denoted by lsrcd(G), is the least number of colors used in d-local strong rainbow coloring. Suppose that G and H are graphs of order m and n, respectively. The corona product of G and H, G ⊙ H, is defined as a graph obtained by taking a copy of G and m copies of H, then connecting every vertex in the i-th copy of H to the i-th vertex of G. In this paper, we will determine the lsrcd(Cm ⊙ Cn) for d=2 and d=3.
Co-Authors Kiki A. Sugeng