THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n

Let be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set . Two distinct vertices u and v in are adjacent if and only if there exists where and such that , and . This definition generalizes the notion of an idempotent divisor graph by involving a triple product, which allows deeper exploration of the combinatorial behavior of idempotents in rings. In this research, we investigate the properties of the triple idempotent graph of the ring of integers modulo n, denoted by . As a results, we establish that and , provided that the graph is connected. Furthermore, is Hamiltonian if n is a prime and , and Eulerian if n is a prime and .

Authors

Institutions

Publication Details

Journal
BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN
Published
2025-07-01
DOI
https://doi.org/10.30598/barekengvol19iss3pp2219-2228
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n

Nughthoh Arfawi Kurdhi, Vika Yugi Kurniawan, Bayu Purboutomo
BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN
Graph Labeling and Dimension Problems
article

THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n

Nughthoh Arfawi Kurdhi, Vika Yugi Kurniawan, Bayu Purboutomo
article en

Abstract

Let be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set . Two distinct vertices u and v in are adjacent if and only if there exists where and such that , and . This definition generalizes the notion of an idempotent divisor graph by involving a triple product, which allows deeper exploration of the combinatorial behavior of idempotents in rings. In this research, we investigate the properties of the triple idempotent graph of the ring of integers modulo n, denoted by . As a results, we establish that and , provided that the graph is connected. Furthermore, is Hamiltonian if n is a prime and , and Eulerian if n is a prime and .

BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPANVol. 19(3)
Sebelas Maret University (ID)
Universitas Sebelas Maret
Openalex Percentile: Top 83%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.