Work

Idempotent total graphs of the rings Z_n: code for computation, verification and visualization

Year: 2026

Type: software

Abstract: Python code for constructing, drawing and analysing the idempotent total graph of the ring Z_n, whose vertices are the non-zero zero-divisors and in which two vertices are adjacent when their sum is an idempotent. The code verifies the degree formula, the degree bounds and the edge-count formula of the accompanying paper for all n up to a given bound.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.22977621

Authors: Kara, Yeliz, Bektaş, Ali Berkan, Cangül, İsmail Naci

Institution: Bursa Uludağ Üni̇versi̇tesi̇

Language: English

Topic: Rings, Modules, and Algebras

Subfield: Algebra and Number Theory

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7214477296

Cites:

Cited by:

Related to: 10