Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 2 (2023) · hlm. 0855–0866

DOI
10.30598/barekengvol17iss2pp0855-0866
ISSN
2615-3017, 1978-7227
Terbit
2023-06-11
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken as its strength of total edge irregular labeling, represented by. In this paper, we discuss the tes of triangular grid graphs, its spanning subgraphs, and Sierpiński gasket graphs.

Jaringan kolaborasi para penulis

8 penulis · 11 tautan kepenulisan bersama

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

  • Universitas Gadjah Mada
  • 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
Hubbi MuhammadUniversitas Gadjah Mada1
Niswah QonitaUniversitas Gadjah Mada1
Regita Agustin Wahyu FibriyantiUniversitas Gadjah Mada1
Agista Surya BawanaUniversitas Gadjah Mada1
Aluysius SutjijanaUniversitas Gadjah Mada1
Veni Rizki LestariAfiliasi tidak diketahui1

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 8 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">TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS</dc:title>
	<dc:creator>Huda, Muhammad Nurul</dc:creator>
	<dc:creator>Susanti, Yeni</dc:creator>
	<dc:description xml:lang="en-US">Let &amp;nbsp;be a graph with &amp;nbsp;and &amp;nbsp;are the set of its vertices and edges, respectively. Total edge irregular -labeling on &amp;nbsp;is a map from &amp;nbsp;to &amp;nbsp;satisfies for any two distinct edges have distinct weights. The minimum &amp;nbsp;for which the &amp;nbsp;satisfies the labeling is spoken as its strength of total edge irregular labeling, represented by . In this paper, we discuss the tes of triangular grid graphs, its spanning subgraphs, and Sierpiński gasket graphs.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-06-11</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/7824</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss2pp0855-0866</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications; 0855-0866</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss2year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/7824/5947</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Muhammad Nurul Huda, Yeni Susanti</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>