Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2377–2390

DOI
10.30598/barekengvol19iss4pp2377-2390
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

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.

Jaringan kolaborasi para penulis

8 penulis · 9 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Bandung Institute of Technology
  • Politeknik Negeri Malang
  • UIN Syekh Wasil Kediri
  • Riau University
  • Sunan Gunung Djati State Islamic University Bandung
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Mahfudhotin MahfudhotinUIN Syekh Wasil Kediri1
Efni AgustiariniRiau University1
Edy Tri BaskoroBandung Institute of Technology1
Hajo J. BroersmaBandung Institute of Technology1
Hilda AssiyatunAfiliasi tidak diketahui1
Rismawati RamdaniSunan Gunung Djati State Islamic University Bandung1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS</dc:title>
	<dc:creator>Palupi, Ratnaning</dc:creator>
	<dc:creator>Salman, A. N. M.</dc:creator>
	<dc:description xml:lang="en-US">Let &amp;nbsp;be a nontrivial simple connected graph, &amp;nbsp;be an edge of &amp;nbsp;and &amp;nbsp;be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled &amp;nbsp;such that . A -shield graph is a graph obtained by &amp;nbsp;and &amp;nbsp;copies of &amp;nbsp;such that the &amp;nbsp;edge of -th &amp;nbsp;embedded to -th edge of &amp;nbsp;by embedding &amp;nbsp;to &amp;nbsp;and &amp;nbsp;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 &amp;nbsp;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 &amp;nbsp;to &amp;nbsp;depending on the order of the wheel.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16714</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2377-2390</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2377-2390</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16714/10980</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Ratnaning Palupi, A.N.M. Salman</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>