Nil Clean Graphs of Rings  

作　　者：Dhiren Kumar Basnet Jayanta Bhattacharyya Dhiren Kumar Basnet Jayanta Bhattacharyya(Department of Mathematical Sciences, Tezpur University Napaazn, Tezpur-784028, Assam, Indi)

机构地区：[1]Department of Mathematical Sciences, Tezpur University Napaazn, Tezpur-784028, Assam, India

出　　处：《Algebra Colloquium》2017年第3期481-492,共12页代数集刊（英文版）

摘　　要：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.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.

关 键 词：nil clean ring weak nil clean ring nil clean graph 

分 类 号：O153.3[理学—数学] O152.1[理学—基础数学]