Results 81 to 90 of about 1,283,848 (178)
Computing the Forgotten Topological Index for Zero Divisor Graphs of MV-Algebras
Topological indices are numerical values in graphs. Recently, they have been an attractive topic and multidisciplinary research area in mathematics, computer science, chemistry, pharmacy, and etc.
Necla KIRCALI GÜRSOY +1 more
core +1 more source
Line cozero-divisor graphs [PDF]
Let R be a commutative ring. The cozero-divisor graph of R denoted by Γ′(R) is a graph with the vertex set W∗(R), where W∗(R) is the set of all non-zero and non-unit elements of R, and two distinct vertices x and y are adjacent if and only if x ∈/ Ry and
Khojasteh, Soheila
core +1 more source
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
Zero-divisor graphs of lower dismantlable lattices I
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
The N‐prime graph and the Subgroup Isomorphism Problem
Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici +2 more
wiley +1 more source
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
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]
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]
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
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

