Perfect Nilpotent Graphs


Download PDF

Authors: M. J. NIKMEHR AND A. AZADI

DOI: 10.46793/KgJMat2104.521N

Abstract:

Let R be a commutative ring with identity. The nilpotent graph of R, denoted by ΓN(R), is a graph with vertex set ZN(R), and two vertices x and y are adjacent if and only if xy is nilpotent, where ZN(R) = {x Rxy is nilpotent, for some y R}. A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph. In this paper, we characterize all rings whose ΓN(R) is perfect. In addition, it is shown that for a ring R, if R is Artinian, then ωN(R)) = χN(R)) = |Nil(R)| + |Max(R)|.



Keywords:

Weakly perfect graph, perfect graph, chromatic number, clique number.



References:

[1]   V. Aghapouramin and M. J. Nikmehr, On perfectness of a graph associated with annihilating ideals of a ring, Discrete Math. Algorithms Appl. 10(04) (2018), 201–212 .

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

[3]   M. F. Atiyah and I. G. Macdonald, Introduction to Commutative Algebra, Addison-Wesley Publishing Company, Massachusetts, London, Ontario,1969.

[4]   I. Beck, Coloring of commutative rings, J. Algebra 116 (1988), 208–226.

[5]   W. Bruns and J. Herzog, Cohen-Macaulay Rings, Cambridge University Press, Cambridge, 1997.

[6]   P. W. Chen, A kind of graph structure of rings, Algebra Colloq. 10(2) (2003), 229–238.

[7]   R. Diestel, Graph Theory, Springer-Verlag, New York, USA, 2000.

[8]   R. Kala and S. Kavitha, Nilpotent graphs of genus one, Discrete Math. Algorithms Appl. 6 (2014), 1450–1463.

[9]   A. Li and Q. Li, A kind of graph of structure on von-Neumann regular rings, Int. J. Algebra 4(6) (2010), 291–302.

[10]   A. H. Li and Q. H. Li, A kind of graph structure on non-reduced rings, Algebra Colloq. 17(1) (2010), 173–180.

[11]   M. J. Nikmehr, R. Nikandish and M. Bakhtyiari, On the essential graph of a commutative ring, J. Algebra Appl. (2017), 175–189.

[12]   A. Patil, B. N. Waphare and V. Joshi, Perfect zero-divisor graphs, Discrete Math. 340 (2017), 740–745.

[13]   B. Smith, Perfect zero-divisor graphs of n, Rose-Hulman Undergrad. Math J. 17 (2016), 114–132.

[14]   D. B. West, Introduction to Graph Theory, 2nd Edition, Prentice Hall, Upper Saddle River, 2001.

[15]   R. Wisbauer, Foundations of Module and Ring Theory, Breach Science Publishers, Reading, 1991.