Results 11 to 20 of about 362 (137)
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avinash Patil +2 more
openaire +2 more sources
The Graph of Equivalence Classes of Zero Divisors [PDF]
ISRN Discrete Mathematics, 2014 We introduce a graph GE(L) of equivalence classes of zero divisors of a meet semilattice L with 0. The set of vertices of GE(L) are the equivalence classes of nonzero zero divisors of L and two vertices [x] and [y] are adjacent if and only if [x]∧[y]=[0]. It is proved that GE(L) is connected and either it contains a cycle of length 3 or GE(L)≅K2. It is
Vinayak Joshi +2 more
openaire +2 more sources
Zero divisor graphs of semigroups
Journal of Algebra, 2005 Let \(S\) be a commutative semigroup with \(0\). A simple graph \(G\) whose vertices are the nonzero zero divisors of \(S\) with two distinct vertices joined by an edge in case when their product in \(S\) is \(0\) is called the zero divisor graph of \(S\). In the paper some characterizations of graphs to be zero divisor graphs of a semigroup are given.
DeMeyer, Frank, DeMeyer, Lisa
openaire +2 more sources
Frequency Assignment Model of Zero Divisor Graph [PDF]
Journal of Applied Mathematics, 2021 Given a frequency assignment network model is a zero divisor graph Γ = V , E
R. Radha, N. Mohamed Rilwan
openaire +2 more sources
On bipartite zero-divisor graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dancheng Lu, Tongsuo Wu
openaire +1 more source
On Reduced Zero-Divisor Graphs of Posets [PDF]
Journal of Discrete Mathematics, 2015 We study some properties of a graph which is constructed from the equivalence classes of nonzero zero-divisors determined by the annihilator ideals of a poset. In particular, we demonstrate how this graph helps in identifying the annihilator prime ideals of a poset that satisfies the ascending chain condition for its proper annihilator ideals.
Ashish Kumar Das, Deiborlang Nongsiang
openaire +2 more sources
Induced subgraphs of zero-divisor graphs
Discrete Mathematics, 2023 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.
G. Arunkumar +3 more
openaire +4 more sources
The Zero Divisor Graph of the Ring Zqp
Science Journal of University of Zakho, 2015 In this paper we construct a star zero divisor graph from the zero divisor graph of the ring Zqp. The star zero divisor graph is obtained by removing some vertices from the zero divisor graph Γ(Zqp), in different ways , but the best way to get star zero divisor graph SΓ(Zqp) is by removing an odd number of zero divisors.
Nazar H. Shuker, Payman A. Rashed
openaire +2 more sources
Converting an Integer to a Decimal String in Under Two Nanoseconds
Software: Practice and Experience, EarlyView.ABSTRACT Objective Converting binary integers to variable‐length decimal strings is a fundamental operation in computing. Conventional fast approaches rely on recursive division and small lookup tables. The goal of this work is to develop a significantly faster method for this task.
Jaël Champagne Gareau, Daniel Lemire
wiley +1 more source