Results 31 to 40 of about 22,120 (235)
Comments on the Clique Number of Zero-Divisor Graphs of Zn
Journal of Mathematics, 2022 In 2008, J. Skowronek-kazio´w extended the study of the clique number ωGZn to the zero-divisor graph of the ring Zn, but their result was imperfect. In this paper, we reconsider ωGZn of the ring Zn and give some counterexamples. We propose a constructive
Yanzhao Tian, Lixiang Li
doaj +1 more source
On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings
AIMS Mathematics, 2022 For a simple connected graph $ G $ of order $ n $, the distance signless Laplacian matrix is defined by $ D^{Q}(G) = D(G) + Tr(G) $, where $ D(G) $ and $ Tr(G) $ is the distance matrix and the diagonal matrix of vertex transmission degrees, respectively.
Bilal A. Rather +4 more
doaj +1 more source
The First Zagreb Index of the Zero Divisor Graph for the Ring of Integers Modulo Power of Primes
Malaysian Journal of Fundamental and Applied Sciences, 2023 Let be a simple graph with the set of vertices and edges. The first Zagreb index of a graph is defined as the sum of the degree of each vertex to the power of two. Meanwhile, the zero divisor graph of a ring , denoted by , is defined as a graph with its
G. Semil @ Ismail +3 more
semanticscholar +1 more source
A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors [PDF]
Communications in Algebra, 2011 We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.
Cameron Wickham, Sandra Spiroff
openaire +3 more sources
Analysis of the Zagreb Indices over the Weakly Zero-Divisor Graph of the Ring Zp×Zt×Zs
Axioms, 2023 Let R be a commutative ring with identity, and Z(R) be the set of zero-divisors of R. The weakly zero-divisor graph of R denoted by WΓ(R) is an undirected (simple) graph with vertex set Z(R)*, and two distinct vertices x and y are adjacent, if and only ...
N. Rehman +3 more
semanticscholar +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 +3 more sources
On the offensive alliance number for the zero divisor graph of Zn.
Mathematical biosciences and engineering : MBE, 2023 A nonempty subset $ D $ of vertices in a graph $ \Gamma = (V, E) $ is said is an offensive alliance, if every vertex $ v \in \partial(D) $ satisfies $ \delta_D(v) \geq \delta_{\overline{D}}(v) + 1 $; the cardinality of a minimum offensive alliance of ...
José Ángel Juárez Morales +3 more
semanticscholar +1 more source
GENERALIZATIONS OF THE ZERO-DIVISOR GRAPH
International Electronic Journal of Algebra, 2020 Let $R$ be a commutative ring with $1 \neq 0$ and $Z(R)$ its set of zero-divisors. The zero-divisor graph of $R$ is the (simple) graph $\Gamma(R)$ with vertices $Z(R) \setminus \{0\}$, and distinct vertices $x$ and $y$ are adjacent if and only if $xy = 0$.
ANDERSON, David F., MCCLURKİN, Grace
openaire +4 more sources
On graphs associated to ring of Guassian integers and ring of integers modulo n
Acta Universitatis Sapientiae: Informatica, 2022 For a commutative ring R with identity 1, the zero-divisor graph of R, denoted by Γ(R), is a simple graph whose vertex set is the set of non-zero zero divisors Z*(R) and the two vertices x and y ∈ Z*(R) are adjacent if and only if xy = 0.
Pirzada S., Bhat M. Imran
doaj +1 more source
On graphs with equal coprime index and clique number
AKCE International Journal of Graphs and Combinatorics, 2023 Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +1 more source