Periodica Mathematica Hungarica

, Volume 67, Issue 2, pp 211–220

# The regular graph of a commutative ring

Article

## Abstract

Let R be a commutative ring, let Z(R) be the set of all zero-divisors of R and Reg(R) = R\Z(R). The regular graph of R, denoted by G(R), is a graph with all elements of Reg(R) as the vertices, and two distinct vertices x, y ∈ Reg(R) are adjacent if and only if x+yZ(R). In this paper we show that if R is a commutative Noetherian ring and 2 ∈ Z(R), then the chromatic number and the clique number of G(R) are the same and they are 2n, where n is the minimum number of prime ideals whose union is Z(R). Also, we prove that all trees that can occur as the regular graph of a ring have at most two vertices.

### Key words and phrases

regular graph Noetherian ring zero-divisors clique number chromatic number

### Mathematics subject classification numbers

05C15 05C25 05C69 13A 13E05

## Preview

### References

1. [1]
S. Akbari, D. Kiani, F. Mohammadi and S. Moradi, The total graph and regular graph of a commutative ring, J. Pure Appl. Algebra, 213 (2009), 2224–2228.
2. [2]
D. F. Anderson and A. Badawi, The total graph of a commutative ring, J. Algebra, 320 (2008), 2706–2719.
3. [3]
M. F. Atiyah and I. G. Macdonald, Introduction to Commutative Algebra, Addison-Wesley Publishing Company, 1969.
4. [4]
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier Publishing Company, New York, 1976.
5. [5]
J. A. Huckaba, Commutative Rings with Zero Divisors, Marcel Dekker, New York, 1988.
6. [6]
R. Y. Sharp, Steps in Commutative Algebra, Second Edition, Cambridge University Press, 2000.