Nil Clean Divisor Graph

From MaRDI portal



Abstract: In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring R, nil clean divisor graph is denoted by GN(R), where the vertex set is such that xy is nil clean, two vertices x and y are adjacent if xy is a nil clean element. We prove some interesting results of nil clean divisor graph of a ring.














This page was built for publication: Nil Clean Divisor Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6315140)