Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

ALGORITHM FOR CONSTRUCTING TRIPLE IDENTITY GRAPH OF RING Z_n USING PYTHON

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

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

Abstract

Let R be a commutative ring. The triple identity graph of ring R is denoted by TE(R) with sets of vertices Two different vertices and are adjacent if and only if there is an element in such that and. To easily visualize the triple identity graph, a program is needed to represent it briefly. Python can easily manipulate, analyze, and visualize data. Therefore, this study uses Python to construct the algorithm for In this research, some examples will be given and then be observed for new characteristics of the triple identity graph of ring such as the connectedness, the diameter, and the girth. And we find the characterize for which graph is empty, connected, or Hamiltonian.

Collaboration network of the authors

13 authors · 22 co-authorship links

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

  • Universitas Sulawesi Tenggara
  • The University of Sydney
  • 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
Santoso Budi WiyonoAffiliation unknown2
Ririn SetiyowatiAffiliation unknown1
Zahra Febrilia RachmawatiAffiliation unknown1
Sutrima SutrimaAffiliation unknown1
Putri WulandariUniversitas Sulawesi Tenggara1
Zakia Nur Ramadhani PutriAffiliation unknown1
Ika Nur FitrianiThe University of Sydney1
Ade Safira SeptianyAffiliation unknown1
Bayu PurboutomoAffiliation 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 TRIPLE IDENTITY GRAPH OF RING Z_n USING PYTHON</dc:title>
	<dc:creator>Kurniawan, Vika Yugi</dc:creator>
	<dc:creator>Ekasiwi, Chessa Fanny</dc:creator>
	<dc:description xml:lang="en-US">Let R be a commutative ring. The triple identity graph of ring R is denoted by TE(R) with sets of vertices  &amp;nbsp;Two different vertices  &amp;nbsp;and  &amp;nbsp;are adjacent if and only if there is an element  &amp;nbsp;in  &amp;nbsp;such that  &amp;nbsp;and  . To easily visualize the triple identity graph, a program is needed to represent it briefly. Python can easily manipulate, analyze, and visualize data. Therefore, this study uses Python to construct the algorithm for  &amp;nbsp;In this research, some examples will be given and then be observed for new characteristics of the triple identity graph of ring  &amp;nbsp;such as the connectedness, the diameter, and the girth. And we find the characterize  &amp;nbsp;for which graph  &amp;nbsp;is empty, connected, or Hamiltonian.</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/12020</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss3pp1629-1638</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; 1629-1638</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/12020/8563</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Vika Yugi Kurniawan, Chessa Fanny Ekasiwi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>