Nil Clean Graphs of Rings
Keyword(s):
In this article, we define the nil clean graph of a ring R. The vertex set is the ring R, and two ring elements a and b are adjacent if and only if a + b is nil clean in R. Graph theoretic properties like the girth, dominating sets, diameter, etc., of the nil clean graph are studied for finite commutative rings.
2013 ◽
Vol 12
(04)
◽
pp. 1250199
◽
Keyword(s):
2014 ◽
Vol 14
(01)
◽
pp. 1550002
◽
Keyword(s):
2018 ◽
Vol 17
(07)
◽
pp. 1850121
Keyword(s):
2012 ◽
Vol 11
(06)
◽
pp. 1250103
◽
Keyword(s):
2014 ◽
Vol 06
(03)
◽
pp. 1450037
Keyword(s):
2020 ◽
Vol 12
(1)
◽
pp. 84-101
◽
Keyword(s):
Keyword(s):
2016 ◽
Vol 08
(03)
◽
pp. 1650043
◽
Keyword(s):