The nn-total graph of an integral domain

preprint2026arXivOpen access

Abstract

Let RR be a finite product of integral domains and DD be a union of prime ideals (it is possible that RR is just an integral domain). Let n≥1n \geq 1 be a positive integer. This paper introduces the nn-total graph of a (R,D)(R, D). The nn-total graph of (R,D)(R, D), denoted by n−T(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+yn∈Dx^n + y^n \in D. In this paper, we study some graph properties and theoretical ring structure.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.