Melola Discovery

← Melola Discovery

Open access Jurnal

Some Types of Irregular Labeling of Diamond Networks on Ten Vertices

Jurnal Matematika, Statistika dan Komputasi · Vol. 18 No. 2 (2022) · pp. 174–180

DOI
10.20956/j.v18i2.17905
ISSN
2614-8811, 1858-1382
Published
2022-01-01
Publisher
Department of Mathematics, Hasanuddin University
Language
en
License
creativecommons.org/licenses/by/4.0

Abstract

There are three interesting parameters in irregular networks based on total labelling, i.e. the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of a graph. Besides that, there is a parameter based on edge labelling, i.e., the irregular labelling. In this paper, we determined the four parameters for diamond graph on eight vertices.

Keywords

Collaboration network of the authors

12 authors · 17 co-authorship links

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

  • Hasanuddin University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Amir Kamal AmirAffiliation unknown2
Loeky HaryantoAffiliation unknown1
Fauziah BaharuddinAffiliation unknown1
winda aritonangAffiliation unknown1
Supri AmirHasanuddin University1
Edy SaputraHasanuddin University1
Aidah Nabilah AnwarAffiliation unknown1
A. Arsunan ArsinAffiliation unknown1
Furqaan NaiemAffiliation 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://journal.unhas.ac.id/index.php/jmsk/oai, first harvested 5 Nov 2026, last seen 5 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">Some Types of Irregular Labeling of Diamond Networks on Ten Vertices</dc:title>
	<dc:creator xml:lang="en">Hinding, Nurdin</dc:creator>
	<dc:creator xml:lang="en">Ahmad, Ali </dc:creator>
	<dc:creator xml:lang="en">Jusmawati, Jusmawati</dc:creator>
	<dc:subject xml:lang="en">Diamond graph, irregular labeling, network</dc:subject>
	<dc:description xml:lang="en">There are three interesting parameters in irregular networks based on total labelling, i.e. the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of a graph. Besides that, there is a parameter based on edge labelling, i.e., the irregular labelling. In this paper, we determined the four parameters for diamond graph on eight vertices.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2022-01-01</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://journal.unhas.ac.id/index.php/jmsk/article/view/17905</dc:identifier>
	<dc:identifier>10.20956/j.v18i2.17905</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 18 No. 2 (2022): JANUARY 2022; 174-180</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/17905/7606</dc:relation>
	<dc:relation>10.20956/j.v18i2.17905.g7606</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2021 Author and publisher</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>