arXiv Open Access 2017

Nil clean graph of rings

Dhiren Kumar Basnet Jayanta Bhattacharyya

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.RA

Penulis (2)

Dhiren Kumar Basnet

Jayanta Bhattacharyya

Format Sitasi

APA MLA BibTeX

Basnet, D.K., Bhattacharyya, J. (2017). Nil clean graph of rings. https://arxiv.org/abs/1701.07630

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓