Weakly nil clean graphs of rings
classification
🧮 math.RA
keywords
graphcleanringbeenweaklyarticlechromaticclique
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.