Prime ideal graphs of commutative rings

Haval Mohammed Salih, Asaad A. Jund


Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP. The relationship among prime ideal, zero-divisor, nilpotent and unit graphs are studied. Also, we show that ΓP is simple connected graph with diameter less than or equal to two and both the clique number and the chromatic number of the graph are equal. Furthermore, it has girth 3 if it contains a cycle. In addition, we compute the number of edges of this graph and investigate some properties of ΓP.


Prime ideal graph, nilpotent graph, clique number, chromatic number

Full Text:




S. Akbari and A. Mohammadian, On zero-divisor graphs of finite rings, J. Algebr., 314 (1) (2007), 168–184.

S. Akbari and A. Mohammadian, Zero-divisor graphs of non-commutative rings, J. Algebr., 296 (2) (2006), 462–479.

D.F. Anderson and P.S. Livingston, The zero-divisor graph of a commutative ring, J. Algebr., 217 (2) (1999), 434–447.

N. Ashrafi, H.R. Maimani, M.R. Poumaki and S. Yassemi, Unit graphs associated with rings, Comm. Algebra, 38 (8) (2010), 2851–2871.

I. Beck, Coloring of commutative rings, J. Algebr.,  116 (1) (1998), 208–226.

J. A. Bondy and U.S.R. Murty, Graph theory (graduate texts in mathematics), Grad. Texts in Math., 44 (2008).

M.J. Nikmehr and S. Khojasteh, On the nilpotent graph of a ring, Turkish J. Math., 37 (4) (2013), 553–559.

J.J. Watkins, Topics in commutative ring theory, Princeton University Press, 2003.


  • There are currently no refbacks.

ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats