Results 151 to 160 of about 24,531 (183)
Scaffolding learning: From specific to generic with large language models. [PDF]
PLoS OneYin DS, Yin X.
europepmc +1 more source
Hardware optimization for effective switching power reduction during data compression in GOLOMB rice coding. [PDF]
PLoS OneSakthivel R +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Generalized Zero-divisor Graphs
2021The zero-divisor graph of a commutative ring has been generalized by several authors. The two most notable generalizations are the ideal-based zero-divisor graph and annihilating-ideal graph of commutative rings. We first discuss the ideal-based zero-divisor graph of a commutative ring.
David F. Anderson +3 more
openaire +1 more source
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
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
On Domination in Zero-Divisor Graphs
Canadian Mathematical Bulletin, 2013AbstractWe 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
Simple Graphs and Zero-divisor Semigroups
Algebra Colloquium, 2009In 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
Journal of Algebra and Its Applications, 2020
Let [Formula: see text] be a commutative ring and [Formula: see text] be the zero divisor graph of [Formula: see text]. In this paper, we investigate when the zero divisor graph is a line graph. We completely present all commutative rings which their zero divisor graphs are line graphs. Also, we study when the zero divisor graph is the complement of a
openaire +2 more sources
Let [Formula: see text] be a commutative ring and [Formula: see text] be the zero divisor graph of [Formula: see text]. In this paper, we investigate when the zero divisor graph is a line graph. We completely present all commutative rings which their zero divisor graphs are line graphs. Also, we study when the zero divisor graph is the complement of a
openaire +2 more sources
Acta Mathematica Hungarica, 2005
As usual, let \(C(X)\) denote the ring of all real-valued continuous functions on a Tychonoff space \(X\). By the zero-divisor graph \(\Gamma (C(X))\) of \(C(X)\) we mean the graph with vertices nonzero zero-divisors of \(C(X)\) such that there is an edge between vertices \(f\), \(g\) if and only if \(f\neq g\) and \(fg=0\).
Azarpanah, F., Motamedi, M.
openaire +1 more source
As usual, let \(C(X)\) denote the ring of all real-valued continuous functions on a Tychonoff space \(X\). By the zero-divisor graph \(\Gamma (C(X))\) of \(C(X)\) we mean the graph with vertices nonzero zero-divisors of \(C(X)\) such that there is an edge between vertices \(f\), \(g\) if and only if \(f\neq g\) and \(fg=0\).
Azarpanah, F., Motamedi, M.
openaire +1 more source
Lobachevskii Journal of Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estaji, A. A. +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estaji, A. A. +2 more
openaire +1 more source