arXiv · 1701.07630
Nil clean graph of rings
Abstract
In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set, diameter etc. of nil clean graph have been studied for finite commutative rings.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dhiren Kumar Basnet, Jayanta Bhattacharyya. 2017-01-26. Nil clean graph of rings. https://doi.org/10.1142/s1005386717000311
Cite the original work for its findings. Save a collection to share your selection of sources.