Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND
Kusbudiono, Kusbudono
Unknown Affiliation
Computer Science & IT Mathematics

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

Found 1 Documents
Search

 1 
(STRONG) RAINBOW CONNECTION NUMBERS ON CORONA PRODUCT OF PATH AND COMPLETE GRAPHS Sulistyanto, Andry; Halikin, Ikhsanul; Kusbudiono, Kusbudono; Wijaya, Kristiana
Jurnal Matematika UNAND Vol. 14 No. 4 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.14.4.376-389.2025

Abstract

Let G be an edge-colored, where adjacent edges may have the same color. A u-v path in G is a rainbow u-v path if no two edges of u-v path are colored the same. The graph G is called rainbow-connected if G contains a rainbow u-v path for every two vertices u and v of G. A rainbow connection number of rainbow-connected G is the minimum color in G. A rainbow u-v path is called a rainbow u-v geodesic if a rainbow u-v path of length distance from a vertex u to v. A graph G is strongly rainbow-connected if G contains a rainbow u-v geodesic for every two vertices u and v of G. The minimum color of the edges of G such that G is strongly rainbow-connected is the strong rainbow connection number. In this paper, we disccus (strong) rainbow connection number of corona product of path and complete graph. 
Co-Authors Ikhsanul Halikin, Ikhsanul Kristiana Wijaya Sulistyanto, Andry