Some results on Nil clean graphs

Abstract

Let R be a commutative ring with nonzero identity. The Nil clean graph N.G(R) is a simple graph with vertex set the Nil clean element of R; and two element x and y are adjoint if and only if xy or x − y in Nil(R). In this paper some of the basic graph theoric properties like the diameter, maximum and mimimum degree, orthogonal set , choromatic number of nil clean graph are studied.