论文部分内容阅读
In this article,we define the nil clean graph of a ring R.The vertex set is the ring R,and two ring elements a and b are adjacent if and only if a + b is nil clean in R.Graph theoretic properties like the girth,dominating sets,diameter,etc.,of the nil clean graph are studied for finite commutative rings.