SOME PROPERTIES OF NIL CLEAN GRAPH

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 we studied some of graph theoretic properties like the chromatic number, clique, orthogonal set and we obtain the triangular of a subgraph N.G۲ (R) of N.G(R).

کلیدواژه ها:

Nil clean graph ، orthogonal idempotent ، Triangular ، chromatic number ، clique number