ZERO-DIVISOR GRAPHS OF REDUCED RICKART ∗-RINGS
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2017, Vol 37, Issue 1
Abstract
For a ring A with an involution ∗, the zero-divisor graph of A, Γ∗ (A), is the graph whose vertices are the nonzero left zero-divisors in A such that distinct vertices x and y are adjacent if and only if xy∗ = 0. In this paper, we study the zero-divisor graph of a Rickart ∗-ring having no nonzero nilpotent element. The distance, diameter, and cycles of Γ∗ (A) are characterized in terms of the collection of prime strict ideals of A. In fact, we prove that the clique number of Γ∗(A) coincides with the cellularity of the hullkernel topological space Σ(A) of the set of prime strict ideals of A, where cellularity of the topological space is the smallest cardinal number m such that every family of pairwise disjoint non-empty open subsets of the space have cardinality at most m.
Authors and Affiliations
A. A. Patil, B. N. Waphare
Keywords
Related Articles
- EP ID EP304539
- DOI -
- Views 50
- Downloads 0
Congruences and Trajectories in Planar Semimodular Lattices
A 1955 result of J. Jakub´ık states that for the prime intervals p and q of a finite lattice, con(p) ≥ con(q) iff p is congruence-projective to q (via intervals of arbitrary size). The problem is how to determine whether...
Note on Ideal Based Zero-Divisor Graph of a Commutative Ring
In this paper, we consider the ideal based zero divisor graph I (R) of a commutative ring R. We discuss some graph theoretical properties of I (R) in relation with zero divisor graph. We also relate certain parameters...
ALL MAXIMAL COMPLETELY REGULAR SUBMONOIDS OF HypG(2)
In this paper we consider mappings σ which map the binary operation symbol f to the term σ(f) which do not necessarily preserve the arity. These mapping are called generalized hypersubstitutions of type τ = (2) and we de...
TRACE INEQUALITIES FOR POSITIVE SEMIDEFINITE MATRICES
Certain trace inequalities for positive definite matrices are generalized for positive semidefinite matrices using the notion of the group generalized inverse.
CODES OVER HYPERFIELDS
In this paper, we define linear codes and cyclic codes over a finite Krasner hyperfield and we characterize these codes by their generator matrices and parity check matrices. We also demonstrate that codes over finite Kr...