Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 2 (2024) · hlm. 0915–0922

DOI
10.30598/barekengvol18iss2pp0915-0922
ISSN
2615-3017, 1978-7227
Terbit
2024-05-25
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Let be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely. Let be a partition of induced by, where is the color class that receives the color. The color code, denoted by, is defined as, where for, and is the distance between two vertices and in G. If all vertices in have different color codes, then is called as the locating-chromatic -coloring of. The locating-chromatic number of, denoted by, is the minimum such that has a locating coloring. Let be the Buckminsterfullerene graph on vertices. Buckminsterfullerene graph is a 3-connected planar graph and a member of the fullerene graphs, representing fullerene molecules in chemistry. In this paper, we determine the locating chromatic number of the disjoint union of Buckminsterfullerene graphs, denoted by.

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
Latifa Azhar AbelAndalas University2
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">ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS</dc:title>
	<dc:creator>Zulkarnain, Debi</dc:creator>
	<dc:creator>Yulianti, Lyra</dc:creator>
	<dc:creator>Welyyanti, Des</dc:creator>
	<dc:creator>Mardimar, Kiki Khaira</dc:creator>
	<dc:creator>Fajri, Muhammad Rafif</dc:creator>
	<dc:description xml:lang="en-US">Let  &amp;nbsp;be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely  . Let  &amp;nbsp;be a partition of  &amp;nbsp;induced by  , where  &amp;nbsp;is the color class that receives the color  . The color code, denoted by  , is defined as  , where  &amp;nbsp;for  , and  &amp;nbsp;is the distance between two vertices  &amp;nbsp;and  &amp;nbsp;in G. If all vertices in  &amp;nbsp;have different color codes, then  &amp;nbsp;is called as the locating-chromatic  -coloring of  . The locating-chromatic number of  , denoted by  , is the minimum  &amp;nbsp;such that  &amp;nbsp;has a locating coloring. Let&amp;nbsp; &amp;nbsp;be the Buckminsterfullerene graph on&amp;nbsp; &amp;nbsp;vertices. Buckminsterfullerene graph is a&amp;nbsp;3-connected planar graph and a member of the fullerene graphs, representing fullerene molecules in chemistry. In this paper, we determine the locating chromatic number of the disjoint union of&amp;nbsp;Buckminsterfullerene&amp;nbsp;graphs, denoted by  .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-05-25</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/11384</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss2pp0915-0922</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application; 0915-0922</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss2year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11384/7905</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Debi Zulkarnain, Lyra Yulianti, Des Welyyanti, Kiki Khaira Mardimar, Muhammad Rafif Fajri</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>