Results 171 to 180 of about 1,460,755 (212)
Stage-Complete Mapping of Pairwise Monocular Structure-from-Motion to Field-Programmable Gate Arrays. [PDF]
Stamatakis P, Vourvoulakis J.
europepmc +1 more source
A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors [PDF]
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.
Cameron G. Wickham, Sandra Spiroff
exaly +4 more sources
On zero-divisor graphs of finite rings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saieed Akbari
exaly +3 more sources
Induced subgraphs of zero-divisor graphs
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the sense that every finite graph is isomorphic to an induced subgraph of a zero-divisor graph.
Peter Cameron, T Tamizh Chelvam
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Zero-Divisor Graph of a Lattice
Results in Mathematics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estaji, E., Khashyarmanesh, K.
openaire +2 more sources
Zero-divisor super-$$\lambda$$ graphs
São Paulo Journal of Mathematical Sciences, 2022A 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
The zero-divisor graphs of MV-algebras
Soft Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aiping Gan, Yichuan Yang
openaire +3 more sources
Chromatic uniqueness of zero-divisor graphs
The Art of Discrete and Applied Mathematics, 2022Summary: 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 +3 more sources

