Results 51 to 60 of about 24,531 (183)
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu +4 more
doaj +1 more source
ABSTRACT We study a random walk on the Lie algebra sl2(Fp)$$ {\mathfrak{sl}}_2\left({\mathbf{F}}_p\right) $$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it
Urban Jezernik, Matevž Miščič
wiley +1 more source
The Zero Divisor Graph of the Ring Zqp.
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 ...
Nazar H. Shuker, Payman A. Rashed
doaj
On Normalized Laplacian Spectra of the Weakly Zero-Divisor Graph of the Ring ℤn
For a finite commutative ring R with identity 1≠0, the weakly zero-divisor graph of R denoted as WΓ(R) is a simple undirected graph having vertex set as a set of non-zero zero-divisors of R and two distinct vertices a and b are adjacent if and only if ...
Nazim, Nadeem Ur Rehman, Ahmad Alghamdi
doaj +1 more source
On Reduced Zero-Divisor Graphs of Posets [PDF]
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
Where Mathematical Symbols Come From
Abstract There is a sense in which the symbols used in mathematical expressions and formulas are arbitrary. After all, arithmetic would be no different if we would replace the symbols ‘+$+$’ or ‘8’ by different symbols. Nevertheless, the shape of many mathematical symbols is in fact well motivated in practice.
Dirk Schlimm
wiley +1 more source
Exploring the properties of the zero-divisor graph of direct product of $\ast$-rings [PDF]
In this paper, we delve into the study of zero-divisor graphs in rings equipped with an involution. Specifically, we focus on abelian Rickart $\ast$-rings.
Mohd Nazim +2 more
doaj +1 more source
Pure simplicial complexes and well-covered graphs [PDF]
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality.
Zaare-Nahandi, Rashid
core
Canonical forms of oriented matroids
Abstract Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full‐dimensional projective polytope is a positive geometry. Motivated by the canonical forms of polytopes, we construct a canonical form for any tope of an oriented matroid inside the Orlik–
Christopher Eur, Thomas Lam
wiley +1 more source
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings
In recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti +2 more
doaj +1 more source

