Results 91 to 100 of about 1,283,908 (223)

On the Foundational Arguments of Sufficient Dimension Reduction

open access: yesWIREs Computational Statistics, Volume 18, Issue 2, June 2026.
Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley   +1 more source

Zero-divisor graphs of lower dismantlable lattices I

open access: yes, 2017
In this paper, we study the zero-divisor graphs of a subclass of dismantlable lattices. These graphs are characterized in terms of the non-ancestor graphs of rooted trees.
Avinash Patil   +3 more
core   +1 more source

Enhancing Preclinical Rigor: Evaluating Robustness and Numerical Stability in a Chronic Pancreatitis Mouse Model

open access: yesAnnals of the New York Academy of Sciences, Volume 1560, Issue 1, June 2026.
In a modified cerulein‐induced chronic pancreatitis (CP) mouse model, key hallmarks of CP were robustly induced in male and female C57BL/6J (BL6) and BALB/c mice, whereas cytokine responses varied partly according to strain and sex. The RORγt inhibitor GSK805 reduced Il23r expression in the BL6 strain, significantly decreased collagen I deposition and ...
Annika Thämlitz   +5 more
wiley   +1 more source

Graph-theoretic characterization of rings: Outer multiset dimension of compressed zero-divisor graphs

open access: yesAin Shams Engineering Journal
This paper investigates the outer multiset dimension (OMSD) of compressed zero-divisor graphs (CZDGs) associated with finite commutative rings (CRs). For a given ring A, the classical zero-divisor graph (ZDG) is refined by compressing its nodes based on ...
Amina Riaz   +3 more
doaj   +1 more source

Classification of posets using zero-divisor graphs

open access: yes, 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

The total zero-divisor graph of commutative rings [PDF]

open access: yes, 2018
In this paper we initiate the study of the total zero-divisor graphs over commutative rings with unity. These graphs are constructed by both relations that arise from the zero-divisor graph and from the total graph of a ring.
Đurić, Alen   +3 more
core   +1 more source

Zero Divisor Graphs and Poset Decomposition [PDF]

open access: yes, 2011
A graph is associated to any commutative ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ...
Putnam, Bette Catherine
core   +1 more source

Coloring of zero-divisor graphs of posets and applications to graphs associated with algebraic structures

open access: yes, 2022
In this paper, we characterize chordal and perfect zero-divisor graphs of finite posets. Also, it is proved that the zero-divisor graphs of finite posets and the complement of zero-divisor graphs of finite $0$-distributive posets satisfy the Total ...
Khandekar, Nilesh, Joshi, Vinayak
core  

On generalized zero divisor graph of a poset

open access: yesDiscrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vinayak Joshi   +2 more
openaire   +3 more sources

The Szeged Index and Padmakar-Ivan Index on the Zero-Divisor Graph of a Commutative Ring

open access: yesContemporary Mathematics and Applications (ConMathA)
The zero-divisor graph of a commutative ring is a graph where the vertices represent the zero-divisors of the ring, and two distinct vertices are connected if their product equals zero.
Jinan Ambar   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy