Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

THE LOCATING CHROMATIC NUMBER OF CHAIN(A,4,n) GRAPH

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 1 (2025) · hlm. 353–360

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

Abstrak

Let be a connected graph with a vertex coloringsuch that two adjacent vertices have different colors. We denote an ordered partition where is a color class with color-, consisting of vertices given color, for. The color code of a vertex in is a -vector:. where is the distance between a vertex in and for. If every two vertices and in have different color codes,, then is called the locating -coloring of. The minimum number of colors k needed in this coloring is defined as the locating chromatic number, denoted by. This paper determines the locating chromatic number of chain graph and the induction of two graphs. Graph is a cyclic graph, which is the identification of, for n>2.

Jaringan kolaborasi para penulis

7 penulis · 13 tautan kepenulisan bersama · 4 lintas organisasi

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

  • Andalas University
  • Bandung Institute of Technology
  • 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
Debi ZulkarnainAndalas University2
Kiki Khaira MardimarAndalas University2
Muhammad Rafif FajriBandung Institute of Technology2
Yanita YanitaAndalas University1

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 LOCATING CHROMATIC NUMBER OF CHAIN(A,4,n) GRAPH</dc:title>
	<dc:creator>Welyyanti, Des</dc:creator>
	<dc:creator>Abel, Latifa Azhar</dc:creator>
	<dc:creator>Yulianti, Lyra</dc:creator>
	<dc:description xml:lang="en-US">Let &amp;nbsp;be a connected graph with a vertex coloringsuch that two adjacent vertices have different colors. We denote an ordered partition &amp;nbsp;where &amp;nbsp;is a color class with color-, consisting of vertices given color , for . The color code of a vertex &amp;nbsp;in &amp;nbsp;is a -vector: . where &amp;nbsp;is the distance between a vertex &amp;nbsp;in &amp;nbsp;and &amp;nbsp;for . If every two vertices &amp;nbsp;and &amp;nbsp;in &amp;nbsp;have different color codes, , then &amp;nbsp;is called the locating -coloring of . The minimum number of colors k needed in this coloring is defined as the locating chromatic number, denoted by . This paper determines the locating chromatic number of chain graph and the induction of two graphs . Graph &amp;nbsp;is a cyclic graph , which is the identification of ,&amp;nbsp;for n&amp;gt;2.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-01-13</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/13526</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss1pp353-360</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 1 (2025): BAREKENG: Journal of Mathematics and Its Application; 353-360</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss1year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13526/9615</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Des Welyyanti, Latifa Azhar Abel, Lyra Yulianti</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>