Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal JTAM (Jurnal Teori dan Aplikasi Matematika)
Meinawati, Rima
Unknown Affiliation
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Algorithm for Constructing Total Graph of Commutative Ring Meinawati, Rima; Kurniawan, Vika Yugi; Kurdhi, Nughthoh Arfawi
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 8, No 2 (2024): April
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v8i2.19850

Abstract

Let R be a commutative ring. The total graph of R, denoted by TΓ(R) is a graph whose vertices are all elements of the ring R and every i,j∈R with i≠j, then i and j vertices are connected by edges if and only if i+j∈Z(R), where Z(R) is the set of zero-divisors in R with 0∈Z(R). Python programming is code that is easy to learn, read, understand, and helpful in explaining problems regarding graphs and algebra. In this paper, we determine an algorithm to construct the total graph of ring Z_n using Python. The research methods in this paper is a literature studies. The results generated by the algorithm can be utilized to observe the characteristic patterns displayed by the graph. Based on the algorithm’s constructed graph pattern, several properties of TΓ(Z_n ) can be inferred. For instance, if n is a prime number, then TΓ(Z_n ) is a disconnected graph. On the other hand, if n is a prime number and n≥3, then TΓ(Z_2n ) and TΓ(Z_4n ) is a connected graph, regular graph, Hamiltonian graph, and has a girth gr(TΓ(〖Z〗_n ))=3. In this paper we creating an algorithm to construct total graphs from commutative rings streamlines the construction process, enhances accessibility and utilization of total graphs, and supports parameter variation exploration and application in problem-solving. 
Co-Authors Nughthoh Arfawi Kurdhi, Nughthoh Arfawi Vika Yugi Kurniawan