Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Pattimura International Journal of Mathematics (PIJMath)
Eri Nugroho
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia
Mathematics

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

Found 1 Documents
Search

 1 
On Local-Strong Rainbow Connection Numbers On Generalized Prism Graphs And Generalized Antiprism Graphs Eri Nugroho; Kiki Ariyanti Sugeng
Pattimura International Journal of Mathematics (PIJMath) Vol 1 No 2 (2022): Pattimura International Journal of Mathematics (PIJMath)
Publisher : Pattimura University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (489.934 KB) | DOI: 10.30598/pijmathvol1iss2pp43-58

Abstract

Rainbow geodesic is the shortest path that connects two different vertices in graph such that every edge of the path has different colors. The strong rainbow connection number of a graph G, denoted by src(G), is the smallest number of colors required to color the edges of G such that there is a rainbow geodesic for each pair of vertices. The d-local strong rainbow connection number, denoted by lrscd, is the smallest number of colors required to color the edges of G such that any pair of vertices with a maximum distance d is connected by a rainbow geodesic. This paper contains some results of lrscd of generalized prism graphs (PmxCn) and generalized antiprism graphs for values of d=2, d=3, and d=4.
Co-Authors Kiki Ariyanti Sugeng