Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

THE REFLEXIVE EDGE STRENGTH OF THE PENTAGONAL SNAKE GRAPH AND CORONA OF THE OPEN TRIANGULAR LADDER AND NULL GRAPH

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

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

Abstrak

Assume that be an undirected simple graph with vertex set and edge set. The edge irregular reflexive -labeling of graph is a labeling selects positive integers from 1 to as edge labels and non negative even numbers from 0 to as vertex labels, and the weights assigned to each edge are distinct, where. On graph with labeling, the weight of edge is represented by which is defined as the sum of edge label and all vertex labels incident to that edge. Reflexive edge strength of graph is the minimum of the highest label, denoted by. In this research, reflexive edge strength for pentagonal snake graph and corona of open triangular ladder and null graph will be determined. The method of this research is literature study, the lower bound of determined by Ryan’s lemma and the upper bound by labeling. The reflexive edge strength of pentagonal snake graph with is for and for The reflexive edge strength of corona of open triangular ladder and null graph with n ≥ 3 and m ≥ 1 is and.

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
Tsabita AzzahraSebelas Maret University1
Lutfiah Alifia ZalzabilaSebelas 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">THE REFLEXIVE EDGE STRENGTH OF THE PENTAGONAL SNAKE GRAPH AND CORONA OF THE OPEN TRIANGULAR LADDER AND NULL GRAPH</dc:title>
	<dc:creator>Indriati, Diari</dc:creator>
	<dc:creator>Utami, Risma Listya</dc:creator>
	<dc:creator>Utomo, Putranto Hadi</dc:creator>
	<dc:description xml:lang="en-US">Assume that  &amp;nbsp;be an undirected simple graph with vertex set  &amp;nbsp;and edge set  . The &amp;nbsp;edge irregular reflexive  -labeling of graph  &amp;nbsp;is a labeling selects positive integers from 1 to  &amp;nbsp;as edge labels and non negative even numbers from 0 to  &amp;nbsp;as vertex labels, and the weights assigned to each edge are distinct, where  . &amp;nbsp;On graph  with  &amp;nbsp;labeling, the weight of &amp;nbsp;edge  &amp;nbsp;is represented by  &amp;nbsp;which is defined as the sum of edge label and all vertex labels incident to that edge. Reflexive edge strength of graph  &amp;nbsp;is the minimum &amp;nbsp;of the highest label, denoted by  . In this research, reflexive edge strength &amp;nbsp;for pentagonal snake graph  &amp;nbsp;and corona of open triangular ladder and null graph  &amp;nbsp;will be determined. The method of this research is literature study, the lower bound of  &amp;nbsp;determined by Ryan’s lemma and the upper bound by labeling. The reflexive edge strength of pentagonal snake graph  &amp;nbsp;with  &amp;nbsp;is  &amp;nbsp;for  &amp;nbsp;and  &amp;nbsp;for  &amp;nbsp;The reflexive edge strength of&amp;nbsp; corona of open triangular ladder and null graph  &amp;nbsp;with n ≥ 3 and m ≥ 1 is  &amp;nbsp;and  .</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/13885</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss4pp2757-2766</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; 2757-2766</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/13885/8915</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Diari Indriati, Risma Listya Utami, Putranto Hadi Utomo</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>