Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

ALGORITHM FOR CONSTRUCTING THE TRIPLE UNIT GRAPH OF TYPE II OF RING Z_n USING PYTHON

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 3 (2024) · pp. 1639–1648

DOI
10.30598/barekengvol18iss3pp1639-1648
ISSN
2615-3017, 1978-7227
Published
2024-07-31
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Let be a commutative ring with as the set of all unit elements in. This paper introduces a new graph associated with the ring, called the triple unit graph of type II, denoted by with the vertex set is − {0,1}. In TU2(R), two distinct vertices, and, are adjacent if there exists with and such that. This paper focuses on the algorithm for constructing using Python. This research uses the literature study research method. The Python programming language can be used to observe the characteristic result of the graph. From the patterns generated by the algorithm, some characteristics of are obtained. For example, if is a prime and, then is a connected graph, a complete graph, a regular graph, and a Hamiltonian graph

Collaboration network of the authors

18 authors · 37 co-authorship links · 7 across different organisations

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

  • State University of Semarang
  • The University of Sydney
  • Universitas Jember
  • Universitas Sulawesi Tenggara
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Nughthoh Arfawi KurdhiAffiliation unknown2
Siswanto SiswantoAffiliation unknown2
Chessa Fanny EkasiwiAffiliation unknown2
Ani RusilowatiState University of Semarang1
Rizki Nor AmeliaAffiliation unknown1
Sri Rejeki Dwi AstutiUniversitas Jember1
Arfatur RohmanState University of Semarang1
Mohammad Roy Thoriqul HaqState University of Semarang1
Ririn SetiyowatiAffiliation unknown1
Zahra Febrilia RachmawatiAffiliation unknown1
Sutrima SutrimaAffiliation unknown1
Putri WulandariUniversitas Sulawesi Tenggara1
Zakia Nur Ramadhani PutriAffiliation unknown1
Ade Safira SeptianyAffiliation unknown1
Bayu PurboutomoAffiliation unknown1
Santoso Budi WiyonoAffiliation 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 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-US">ALGORITHM FOR CONSTRUCTING THE TRIPLE UNIT GRAPH OF TYPE II OF RING Z_n USING PYTHON</dc:title>
	<dc:creator>Fitriani, Ika Nur</dc:creator>
	<dc:creator>Kurniawan, Vika Yugi</dc:creator>
	<dc:description xml:lang="en-US">Let  &amp;nbsp;be a commutative ring with  &amp;nbsp;as the set of all unit elements in  . This paper introduces a new graph associated with the ring  , called the triple unit graph of type II, denoted by  &amp;nbsp;with the vertex set is  &amp;nbsp;− {0,1}. In TU2(R), two distinct vertices,  &amp;nbsp;and  , are adjacent if there exists  &amp;nbsp;with  &amp;nbsp;and  &amp;nbsp;such that  . This paper focuses on the algorithm for constructing  &amp;nbsp;using Python. This research uses the literature study research method. The Python programming language can be used to observe the characteristic result of the graph. From the patterns generated by the algorithm, some characteristics of  &amp;nbsp;are obtained. For example, if  &amp;nbsp;is a prime and  , then  &amp;nbsp;is a connected graph, a complete graph, a regular graph, and a Hamiltonian graph</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-07-31</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/12056</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss3pp1639-1648</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application; 1639-1648</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss3year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12056/8562</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Ika Nur Fitriani, Vika Yugi Kurniawan</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>