Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

EDGE IRREGULAR REFLEXIVE LABELING ON MONGOLIAN TENT GRAPH (M_(m,3)) AND DOUBLE QUADRILATERAL SNAKE GRAPH

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 4 (2023) · hlm. 1933–1940

DOI
10.30598/barekengvol17iss4pp1933-1940
ISSN
2615-3017, 1978-7227
Terbit
2023-12-18
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge irregular reflexive k-labeling f is one in which the label for each edge is an integer number {1,2,…, k_e} and the label for each vertex is an even integer number {0,2,4,…,2k_v}, k = max{ k_e,2k_v}. This type of labeling results in distinct weights for each edge. The weight of an edge xy in a graph G with labeling f, indicated by wt (xy), is the total of the labels on the vertex that are incident to the edge as well as the edge label. The minimum value k of the largest label in the graph G is referred to as res (G), which stands for the reflexive edge strength of the graph G. The topic of edge irregular reflexive k-labeling for mongolian tent graph (M_(m,n)) and double quadrilateral snake graph (D(Q_n )) will be discussed in this paper. The res (M_(m,n)),m≥2,n=3 has been obtained that is ⌈(5m-1)/3⌉ for 5m-1≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 5m-1≡2,3 (mod 6). Also the res (D(Q_n )),n≥2 has been obtained that is ⌈(7n-7)/3⌉ for 7n-7≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 7n-7≡2,3 (mod 6).

Jaringan kolaborasi para penulis

9 penulis · 12 tautan kepenulisan bersama

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

  • Sebelas Maret University
  • 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
Titin Sri MartiniSebelas Maret University2
Lutfiah Alifia ZalzabilaSebelas Maret University1
Risma Listya UtamiSebelas Maret University1
Putranto Hadi UtomoSebelas Maret University1
Thetania Miftakul ZalsaSebelas Maret University1
Budiyono BudiyonoSebelas Maret University1
Enyta Ramadisae PutriSebelas Maret 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">EDGE IRREGULAR REFLEXIVE LABELING ON MONGOLIAN TENT GRAPH (M_(m,3)) AND DOUBLE QUADRILATERAL SNAKE GRAPH</dc:title>
	<dc:creator>Indriati, Diari</dc:creator>
	<dc:creator>Azzahra, Tsabita</dc:creator>
	<dc:description xml:lang="en-US">Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge irregular reflexive k-labeling f is one in which the label for each edge is an integer number {1,2,…, k_e} and the label for each vertex is an even integer number {0,2,4,…,2k_v}, k = max{ k_e,2k_v}. This type of labeling results in distinct weights for each edge. The weight of an edge xy in a graph G with labeling f, indicated by wt (xy), is the total of the labels on the vertex that are incident to the edge as well as the edge label. The minimum value k of the largest label in the graph G is referred to as res (G), which stands for the reflexive edge strength of the graph G. The topic of edge irregular reflexive k-labeling for mongolian tent graph (M_(m,n)) and double quadrilateral snake graph (D(Q_n )) will be discussed in this paper. The res (M_(m,n)),m≥2,n=3 has been obtained that is ⌈(5m-1)/3⌉ for 5m-1≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 5m-1≡2,3 (mod 6). Also the res (D(Q_n )),n≥2 has been obtained that is ⌈(7n-7)/3⌉ for 7n-7≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 7n-7≡2,3 (mod 6). </dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-12-18</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/9073</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss4pp1933-1940</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications; 1933-1940</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss4year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/9073/7168</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Diari Indriati, Tsabita Azzahra</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>