Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPH sp(m,r,4)

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 1 (2024) · pp. 0213–0222

DOI
10.30598/barekengvol18iss1pp0213-0222
ISSN
2615-3017, 1978-7227
Published
2024-03-01
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

his study aims to determine the total vertex irregularity strength on a series parallel graph for and. Total labeling is said to be vertex irregular, if the weights for each vertices are different. Determination of the total vertex irregularity of series parallel graph is done by obtaining the largest lower bound and the smallest upper bound. The lower bound is obtained by analyzing the structure of the graph to obtain the largest minimum label of k and the upper bound is analyzed by labeling the vertices and edges of the graph, where the largest label is k and the values for each vertices weight is different. The result obtained for the total vertex irregularity strength of a series parallel graph is.

Collaboration network of the authors

10 authors · 19 co-authorship links · 3 across different organisations

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

  • Universitas Islam Negeri Sultan Syarif Kasim Riau
  • Caltex Riau Polytechnic
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Wartono WartonoUniversitas Islam Negeri Sultan Syarif Kasim Riau2
Fitri AryaniUniversitas Islam Negeri Sultan Syarif Kasim Riau2
Dian Ayu PuspitaUniversitas Islam Negeri Sultan Syarif Kasim Riau2
Mohammad SolehUniversitas Islam Negeri Sultan Syarif Kasim Riau1
Muhafzan MuhafzanAffiliation unknown1
Neng SantiUniversitas Islam Negeri Sultan Syarif Kasim Riau1

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">ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPH sp(m,r,4)</dc:title>
	<dc:creator>Marzuki, Corry Corazon</dc:creator>
	<dc:creator>Utami, Aminah</dc:creator>
	<dc:creator>Elviyenti, Mona</dc:creator>
	<dc:creator>Muda, Yuslenita</dc:creator>
	<dc:description xml:lang="en-US">his study aims to determine the total vertex irregularity strength on a series parallel graph&amp;nbsp;for &amp;nbsp;and . Total labeling is said to be vertex irregular, if the weights for each vertices are different. Determination of the total vertex irregularity of series parallel graph is done by obtaining the largest lower bound and the smallest upper bound. The lower bound is obtained by analyzing the structure of the graph to obtain the largest minimum label of k and the upper bound is analyzed by labeling the vertices and edges of the graph, where the largest label is k and the values for each vertices weight is different. The result obtained for the total vertex irregularity strength of a series parallel graph &amp;nbsp;is .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-03-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://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10214</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss1pp0213-0222</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application; 0213-0222</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss1year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10214/7546</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Corry Corazon Marzuki, Aminah Utami, Mona Elviyenti, Yuslenita Muda</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>