Results 41 to 50 of about 1,283,848 (178)

Zero-divisor graphs of idealizations

open access: yes, 2006
We consider zero-divisor graphs of idealizations of commutative rings. Specifically, we look at the preservation, or lack thereof, of the diameter and girth of the zero-divisor graph of a ring when extending to idealizations of the ...
Stickles, Joe, Axtell, Michael
core   +1 more source

Line Graphs of Monogenic Semigroup Graphs

open access: yesJournal of Mathematics, 2021
The concept of monogenic semigroup graphs ΓSM is firstly introduced by Das et al. (2013) based on zero divisor graphs. In this study, we mainly discuss the some graph properties over the line graph LΓSM of ΓSM.
Nihat Akgunes   +2 more
doaj   +1 more source

A class of zero divisor rings in which every graph is precisely the union of a complete graph and a complete bipartite graph

open access: yesOpen Mathematics, 2015
Recently, an interest is developed in estimating genus of the zero-divisor graph of a ring. In this note we investigate genera of graphs of a class of zero-divisor rings (a ring in which every element is a zero divisor).
Nauman Syed Khalid, Shafee Basmah H.
doaj   +1 more source

The Zero Divisor Graphs of a finite Certain Rings [PDF]

open access: yesالمجلة العراقية للعلوم الاحصائية, 2013
For each commutative ring we associate a ...
Nazar H. Shuker, Husam Q. Mohammad
doaj   +1 more source

Zero-divisor ideals and realizable zero-divisor graphs

open access: yes, 2009
We seek to classify the sets of zero-divisors that form ideals based on their zero-divisor graphs. We offer full classification of these ideals within finite commutative rings with identity. We also provide various results concerning the realizability of
Stickles, Joe   +5 more
core   +1 more source

Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays

open access: yesJournal 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

open access: yesKuwait Journal of Science
Let 𝑅 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

Component graphs of vector spaces and zero-divisor graphs of ordered sets [PDF]

open access: yes, 2022
In this paper, nonzero component graphs and nonzero component union graphs of finite dimensional vector space are studied using the zero-divisor graph of specially constructed 0-1-distributive lattice and the zero-divisor graph of rings.
Khandekar, Nilesh   +2 more
core  

The Zero-Divisor Graphs of Variation Monogenic Semigroups

open access: yesScientific Journal of King Faisal University: Basic and Applied Sciences, 2020
The undirected graph Γ(〖VS〗_Mn) is the zero-divisor graph of the monogenic semigroup SM with zero. The non-zero vertices xi and xj of this graph are adjacent whenever i + j > n and gcd⁡(i,j)=1, where n is the order of Γ(〖VS〗_Mn).
Bana Jawid Al Subaiei   +1 more
doaj   +1 more source

On the additive image of zeroth persistent homology

open access: yesTransactions 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

Home - About - Disclaimer - Privacy