English

The n-total graph of a commutative ring

Commutative Algebra 2025-08-18 v1

Abstract

Let RR be a commutative ring with 101\not = 0, Z(R)Z(R) be the set of all zero-divisors of RR, and n1n \geq 1. This paper introduces the nn-total graph of a commutative ring RR. The nn-total graph of a commutative ring RR, denoted by nT(R)n-T(R), is an undirected simple graph with vertex set RR, such that two vertices x,yx, y in RR are connected by an edge if xn+ynx^n + y^n in Z(R)Z(R). Note that if n=1n =1, then the 11-total graph of RR is the total graph of RR in the sense of Anderson-Badawi's paper on the total graph of a commutative ring. In this paper, we study some graph properties and theoretical ring structure.

Keywords

Cite

@article{arxiv.2508.11361,
  title  = {The n-total graph of a commutative ring},
  author = {Djamila AitElhadi and Ayman Badawi},
  journal= {arXiv preprint arXiv:2508.11361},
  year   = {2025}
}
R2 v1 2026-07-01T04:51:29.785Z