AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.1 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Quasi-idempotent graphs of rings

School of Mathematics and Physics, Hechi University, Yizhou 546300, China
Show Author Information

Abstract

Let R be a ring. An element a R is called a quasi-idempotent if there exists a central unit k in R such that a 2 = k a. The quasi-idempotent graph of R, denoted by G Q i d ( R ), is the simple undirected graph with vertex set R itself, where two distinct vertices a and b are adjacent if and only if a + b is a quasi-idempotent. This paper presents a systematic study of the graph G Q i d ( R ). We examine its basic structural properties, including connectivity and girth. We introduce a new invariant of the ring, termed the quasi-idempotent sum number, and establish the precise relationship between this invariant and the graph diameter. Furthermore, a complete classification is obtained for all finite commutative rings R according to the genus of G Q i d ( R ), thereby characterizing the rings for which this graph has genus 0, 1, or 2.

CLC number: 05C25, 13A99, 16L99

References

【1】
【1】
 
 
AIMS Mathematics
Pages 3349-3366

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Luo S. Quasi-idempotent graphs of rings. AIMS Mathematics, 2026, 11(2): 3349-3366. https://doi.org/10.3934/math.2026136

168

Views

3

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 30 August 2025
Revised: 13 January 2026
Accepted: 20 January 2026
Published: 04 February 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)