Clean graph of a ring
Yükleniyor...
Dosyalar
Tarih
2020
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Scientific
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let R be a ring (not necessarily commutative) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in form (e,u), where e is an idempotent and u is a unit of R; and two distinct vertices (e,u) and (f,v) are adjacent if and only if ef = fe = 0 or uv = vu = 1. In this paper, we focus on Cl2(R), the subgraph of Cl(R) induced by the set {(e,u): e is a nonzero idempotent element of R}. It is observed that Cl2(R) has a crucial role in Cl(R). The clique number, the chromatic number, the independence number and the domination number of the clean graph for some classes of rings are determined. Moreover, the connectedness and the diameter of Cl2(R) are studied. © 2021 World Scientific Publishing Company.
Açıklama
WOS:000685570200001
Anahtar Kelimeler
Chromatic Number, Clean Graph, Clique Number, Idempotent, Unit
Kaynak
WoS Q Değeri
Q3
Scopus Q Değeri
Q2
Cilt
Sayı
Künye
Habibi, M., Yetkin, Çelikel, E., Abdioğlu, C. (2020). Clean graph of a ring. Journal of Algebra and Its Applications, 2150156.
