ALGORITHM FOR CONSTRUCTING TRIPLE IDENTITY GRAPH OF RING Z_n USING PYTHON

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. P...

Full description

Saved in:
Bibliographic Details
Published inBAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN Vol. 18; no. 3; pp. 1629 - 1638
Main Authors Kurniawan, Vika Yugi, Ekasiwi, Chessa Fanny
Format Journal Article
LanguageEnglish
Published Universitas Pattimura 31.07.2024
Subjects
commutative ring
integer ring modulo-n
python
triple identity graph
Online AccessGet full text
ISSN1978-7227
2615-3017
2615-3017
DOI10.30598/barekengvol18iss3pp1629-1638

Cover

More Information
Summary: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.
ISSN:1978-7227
2615-3017
2615-3017
DOI:10.30598/barekengvol18iss3pp1629-1638