Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS

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

DOI
10.30598/barekengvol17iss2pp0855-0866
ISSN
2615-3017, 1978-7227
Published
2023-06-11
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Collaboration network of the authors

8 authors · 11 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Gadjah Mada
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
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 LestariAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 8 Nov 2026.
Original metadata (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>