Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 4 (2024) · hlm. 2767–2778

DOI
10.30598/barekengvol18iss4pp2767-2778
ISSN
2615-3017, 1978-7227
Terbit
2024-10-14
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Graph is a simple, connected, undirected graph with vertex set and edge set. A graph is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from until and its edges can be labeled with positive integers from to such that the weights for all the edges are different, where. The weight of edge uv in graph with labeling, denoted by, is defined as sum of the edge label and all vertex labels incident to that edge. The reflexive edge strength of a graph, denoted by, is the value of minimum of the largest label. In this paper, edge irregular reflexive -labeling for Dumbbell Graph and corona of open ladder and null graph will be determined. The reflexive edge strength of the Dumbbell Graph with and is for and for The reflexive edge strength of the corona of open ladder and null graph with n ≥ 3 and m ≥ 1 is for and for.

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
Lutfiah Alifia ZalzabilaSebelas Maret University2
Tsabita AzzahraSebelas Maret University1
Risma Listya UtamiSebelas Maret University1
Putranto Hadi UtomoSebelas 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 OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH</dc:title>
	<dc:creator>Zalsa, Thetania Miftakul</dc:creator>
	<dc:creator>Indriati, Diari</dc:creator>
	<dc:creator>Martini, Titin Sri</dc:creator>
	<dc:description xml:lang="en-US">Graph  &amp;nbsp;is a simple, connected, undirected graph with vertex set  &amp;nbsp;and edge set  . A graph  &amp;nbsp;is called to have an edge irregular reflexive  -labeling if its vertices can be labeled with even numbers from  &amp;nbsp;until  &amp;nbsp;and its edges can be labeled with positive integers from  &amp;nbsp;to  &amp;nbsp;such that the weights for all the edges are different, where  . The weight of edge uv in graph  &amp;nbsp;with  &amp;nbsp;labeling, denoted by  , is defined as sum of the edge label and all vertex labels incident to that edge. The reflexive edge strength of a graph  , denoted by  , is the value of minimum  &amp;nbsp;of the largest label. In this paper, edge irregular reflexive  -labeling for Dumbbell Graph  &amp;nbsp;and corona of open ladder and null graph  &amp;nbsp;will be determined. The reflexive edge strength of the Dumbbell Graph  &amp;nbsp;with  &amp;nbsp;and  &amp;nbsp;is  &amp;nbsp;for  &amp;nbsp;and  &amp;nbsp;for  &amp;nbsp;The reflexive edge strength of the corona of open ladder and null graph  &amp;nbsp;with n ≥ 3 and m ≥ 1 is  for &amp;nbsp;and  for .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-10-14</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/13892</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss4pp2767-2778</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application; 2767-2778</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss4year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13892/8916</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Thetania Miftakul Zalsa, Diari Indriati, Titin Sri Martini</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>