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 India 

出 版 物：《Algebra Colloquium》 (代数集刊（英文版）)

年 卷 期：2017年第24卷第3期

页      面：481-492页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by Government of India under UGC-CSIR NET JRF scheme  UGC Memo 

主　　题：nil clean ring weak nil clean ring nil clean graph 

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