Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal BAREKENG: Jurnal Ilmu Matematika dan Terapan
Salman, A. N. M.
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 1 Documents
Search

 1 
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS Palupi, Ratnaning; Salman, A. N. M.
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss4pp2377-2390

Abstract

Let be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that . A -shield graph is a graph obtained by and copies of such that the edge of -th embedded to -th edge of by embedding to and to . A path in a vertex-colored graph is said to be rainbow-vertex path if every internal vertex in the path has different color. A vertex-colored graph is said to be rainbow-vertex connected if for every pair of vertices there exists a rainbow-vertex path connecting them. The rainbow- vertex connection number of , denoted by , is the minimum colors needed to make rainbow-vertex connected. In this paper, we determine the rainbow-vertex connection numbers of of wheel-shield graphs , specifically finding that the number ranges from to depending on the order of the wheel.
Co-Authors Palupi, Ratnaning