Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

CONSTRUCT THE TRIPLE ZERO GRAPH OF RING Z_n USING PYTHON

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

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

Abstract

Let be a commutative ring with nonzero identity and there exists such that,,, denotes the set of all triple zero elements of. The triple zero graph of, denoted by, is an undirected graph with vertex set where two distinct vertices and are adjacent if and only if, and there exists a nonzero element of such that,, and. Python is a programming language with simple and easy-to-learn code that can be used to solve problems in algebra and graphs. In this paper, we construct the triple zero graph of ring using Python. Based on the output of the program, several properties of are obtained, such as if and, then is a planar graph, if with is prime numbers, then is a complete graph, and if with is prime numbers and, then is a connected graph.

Collaboration network of the authors

25 authors · 48 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
Siswanto SiswantoAffiliation unknown2
Chessa Fanny EkasiwiAffiliation unknown2
Bayu PurboutomoAffiliation unknown2
La Ode BariunUniversitas Sulawesi Tenggara1
Ayu Lestari DewiUniversitas Sulawesi Tenggara1
Dewi Retno Sari SaputroAffiliation unknown1
Andjani Ayu Cahaya TanjungAffiliation unknown1
Ririn SetiyowatiAffiliation unknown1
Zahra Febrilia RachmawatiAffiliation unknown1
Sutrima SutrimaAffiliation unknown1
Purnami WidyaningsihAffiliation unknown1
Anas IvanniAffiliation unknown1
Zakia Nur Ramadhani PutriAffiliation unknown1
Ika Nur FitrianiThe University of Sydney1
Ade Safira SeptianyAffiliation unknown1
Sutanto SutantoAffiliation unknown1
Nabiella Zahra RizkitaAffiliation unknown1
Santoso Budi WiyonoAffiliation unknown1
Yogi Pasca PratamaAffiliation unknown1
Muhammad Bagus SistriatmajaAffiliation unknown1
Beny Trias OktoraAffiliation unknown1
Salju Indara Zeith GeisthAffiliation 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">CONSTRUCT THE TRIPLE ZERO GRAPH OF RING Z_n  USING PYTHON</dc:title>
	<dc:creator>Wulandari, Putri</dc:creator>
	<dc:creator>Kurniawan, Vika Yugi</dc:creator>
	<dc:creator>Kurdhi, Nughthoh Arfawi</dc:creator>
	<dc:description xml:lang="en-US">Let  &amp;nbsp;be a commutative ring with nonzero identity and  &amp;nbsp;there exists  &amp;nbsp;such that  ,  ,  ,  &amp;nbsp;denotes the set of all triple zero elements of  . The triple zero graph of  , denoted by  , is an undirected graph with vertex set  &amp;nbsp;where two distinct vertices  &amp;nbsp;and  &amp;nbsp;are adjacent if and only if  , and there exists a nonzero element  &amp;nbsp;of  &amp;nbsp;such that  ,  , and  . Python is a programming language with simple and easy-to-learn code that can be used to solve problems in algebra and graphs. In this paper, we construct the triple zero graph of ring  &amp;nbsp;using Python. Based on the output of the program, several properties of  &amp;nbsp;are obtained, such as if  &amp;nbsp;and  , then  &amp;nbsp;is a planar graph, if  &amp;nbsp;with  &amp;nbsp;is prime numbers, then  &amp;nbsp;is a complete graph  , and if  &amp;nbsp;with  &amp;nbsp;is prime numbers and  , then  &amp;nbsp;is a connected graph.</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/11007</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss1pp0507-0516</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; 0507-0516</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/11007/7583</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Putri Wulandari, Vika Yugi Kurniawan, Nughthoh Arfawi Kurdhi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>