Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Muhardiansyah, Muhardiansyah
Department of Mathematics and Data Science, Faculty of Mathematics and Natural Sciences, Universitas Andalas
Electrical & Electronics Engineering

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

Found 1 Documents
Search

 1 
On the rainbow connection numbers of line, middle, and total graphs of wheels Yulianti, Lyra; Muhardiansyah, Muhardiansyah; Nazra, Admi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.2

Abstract

An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow connected graph. Similarly defined, an edge-colored graph G is called strong rainbow connected if any two vertices in G are connected by a geodesic path whose no two of its edges are colored the same. The strong rainbow connection for G, denoted by src(G), is the smallest number of colors needed such that G be a strong rainbow connected graph. This paper considers the determination of the rainbow connection and strong rainbow connection numbers of the line graph, the middle graph, and the total graph of a wheel Wn on n + 1 vertices.
Co-Authors Admi Nazra Yulianti, Lyra