Results 51 to 60 of about 1,233,365 (217)
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings
Kuwait Journal of ScienceLet 𝑅 be a commutative ring and let 𝑍∗ (𝑅) denote the set of non-zero zero divisors of 𝑅. The zero divisor graph 𝛤(𝑅) is defined as the simple graph with vertex set 𝑍∗ (𝑅), where two distinct vertices 𝑥, 𝑦 ∈ 𝑍∗ (𝑅) are adjacent if and only if 𝑥𝑦 = 0.
Bilal Ahmad Rather +3 more
doaj +1 more source
The Zero-Divisor Graph of a Commutative Ring
Journal of Algebra, 1999 The authors study properties of the graph \(\Gamma(R)\) of a commuting ring \(R\) (with \(1\)) defined on the set of nonzero zero-divisors with adjacency relation \((x,y)\in E\) if \(xy= 0\) noting that the class of such graphs is strongly restricted by the (commutative) ring properties of \(R\).
Anderson, David F. +1 more
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
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Induced subgraphs of zero-divisor graphs
, 2022 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
Chelvam, T. Tamizh +3 more
core
Zero-divisor Graphs of Localizations and Modular Rings [PDF]
, 2017 In this paper, we examine the algebraic properties of localizations of commutative rings and how localizations affect the zero-divisor graphs structure of modular rings.
Cuchta, Thomas +2 more
core +1 more source
Topological Indices of Total Graph and Zero Divisor Graph of Commutative Ring: A Polynomial Approach
Complexity, 2023 The algebraic polynomial plays a significant role in mathematical chemistry to compute the exact expressions of distance-based, degree-distance-based, and degree-based topological indices.
Sourav Mondal +3 more
doaj +1 more source
A tropical version of Martens' theorem for metric graphs
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We study the conjecture stated by Jensen and Len on a tropical version on Martens' theorem via the Brill–Noether rank of a tropical curve. We recall Coppens' counterexample of Martens‐special chain of cycles, and we generalize the construction defining another class of graphs, Martens‐special trees of cycles, for which the conjecture does not ...
Giusi Capobianco, Angelina Zheng
wiley +1 more source
Classification of posets using zero-divisor graphs
, 2018 Halaš and Jukl associated the zero-divisor graph G to a poset (X,≤) with zero by declaring two distinct elements x and y of X to be adjacent if and only if there is no non-zero lower bound for {x, y}.
Arsham Borumand Saeid +2 more
core +1 more source