Weakly nil clean graphs of rings

From MaRDI portal
Publication:6286959




Abstract: In this article, the concept of nil clean graph of a ring has been generalised to weakly nil clean graph of a ring and graph theoretic properties like girth, clique number, diameter and chromatic index of the graph have been studied for a finite commutative ring.











This page was built for publication: Weakly nil clean graphs of rings

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