Results 141 to 150 of about 600 (179)
Some of the next articles are maybe not open access.

The Zero-Divisor Graph of a Lattice

Results in Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazem Khashyarmanesh, Khashyarmanesh K
exaly   +3 more sources

Zero Divisor Graph of a Poset with Respect to an Ideal

Order, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vinayak Joshi
exaly   +3 more sources

On Domination in Zero-Divisor Graphs

Canadian Mathematical Bulletin, 2013
AbstractWe first determine the domination number for the zero-divisor graph of the product of two commutative rings with 1. We then calculate the domination number for the zero-divisor graph of any commutative artinian ring. Finally, we extend some of the results to non-commutative rings in which an element is a left zero-divisor if and only if it is a
Rad, Nader Jafari   +2 more
openaire   +1 more source

The zero-divisor graphs of MV-algebras

Soft Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aiping Gan, Yichuan Yang
openaire   +2 more sources

Chromatic uniqueness of zero-divisor graphs

The Art of Discrete and Applied Mathematics, 2022
Summary: The zero-divisor graph \(\Pi(R)\) of a commutative ring \(R\) is the graph whose vertices are the elements of \(R\) such that the vertices \(u\) and \(v\) are adjacent if and only if \(uv=0\). If the graphs \(G\) and \(H\) have the same chromatic polynomial, then we say that they are chromatically equivalent (or \(\chi -\) equivalent), written
Haneen Al-Janabi, Gábor Bacsó
openaire   +2 more sources

Graphs and Zero-Divisors

The College Mathematics Journal, 2010
The last ten years have seen an explosion of research in the zero-divisor graphs of commutative rings—by professional mathematicians and undergraduates.
Axtell, Michael, Stickles, Joe
openaire   +2 more sources

Zero-divisor super-$$\lambda$$ graphs

São Paulo Journal of Mathematical Sciences, 2022
A maximally edge-connected graph with all minimum edge-cuts trivial is called super-\(\lambda\). In this paper, using the finite direct product of finite fields, the ring of the residues, and the trivial extension of rings by a module, the authors show that there are various classes of rings whose zero-divisor graphs are super-\(\lambda\) and then ...
Driss Bennis   +2 more
openaire   +1 more source

A Characterization of Bipartite Zero-divisor Graphs

Canadian Mathematical Bulletin, 2014
AbstractIn this paper we obtain a characterization for all bipartite zero-divisor graphs of commutative rings R with 1 such that R is finite or |Nil(R)| ≠ 2.
Rad, Nader Jafari, Jafari, Sayyed Heidar
openaire   +1 more source

Simple Graphs and Zero-divisor Semigroups

Algebra Colloquium, 2009
In this paper, we provide examples of graphs which uniquely determine a zero-divisor semigroup. We show two classes of graphs that have no corresponding semigroups. Especially, we prove that no complete r-partite graph together with two or more end vertices (each linked to distinct vertices) has corresponding semigroups.
Wu, Tongsuo, Chen, Li
openaire   +1 more source

On zero divisor graphs of the rings $$Z_n$$

Afrika Matematika, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Pirzada, M. Aijaz, M. Imran Bhat
openaire   +2 more sources

Home - About - Disclaimer - Privacy