Common zero-divisor graph over a commutative ring (Q6650982)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Common zero-divisor graph over a commutative ring |
scientific article; zbMATH DE number 7956088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Common zero-divisor graph over a commutative ring |
scientific article; zbMATH DE number 7956088 |
Statements
Common zero-divisor graph over a commutative ring (English)
0 references
9 December 2024
0 references
Assume that \(R\) is a finite commutative ring with non-zero identity, \(Z(R)\) denotes the set of all zero-divisors of \(R\), and \(Z(R)^*\) denotes the set of non-zero zero-divisor of \(R\). Recall that the zero-divisor graph of \(R\) is the undirected simple graph with vertex set \(Z(R)^*\), and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(xy = 0\). Let \(S\) be a non-empty subset of \(Z(R)^*\). Then the \textit{common zero-divisor graph} \(R\) with respect to \(S\), denoted by \(\Gamma(R, S)\), is an undirected simple graph whose vertices are \(Z(R)^*\) and two distinct vertices \(x\) and \(y\) are adjacent if and only if there exists \(s\in S\) such that \(sx = 0 = sy\). The main aim of this work is to explore the properties of the graph \(\Gamma(R,S)\). The authors, in Section 2, argued on some general properties of the graph \(\Gamma(R,S)\) in Lemma 2.6 and Theorems 2.8, 2.10, and 2.12. After that, in Section 3, they focused on the connectivity of the graph \(\Gamma(R,S)\) in Theoerms 3.4 and 3.5. Next, in Section 4, the authors studied the regularity of the graph \(\Gamma(R,S)\) in Theorems 4.3 and 4.4. Finally, they closed this paper by investigating the graph \(\Gamma(\mathbb{Z}_n, S)\), where \(S\) is a non-empty subset of \(Z(\mathbb{Z}_n)^*\) in Theorem 5.4.
0 references
zero-divisor graph
0 references
common zero-divisor graph
0 references
Cayley graph
0 references
connectivity
0 references
regularity
0 references
0.8464806079864502
0 references
0.8461204171180725
0 references
0.8388491868972778
0 references
0.834019660949707
0 references
0.8331684470176697
0 references