A generalization of the cozero-divisor graph of a commutative ring

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be an ideal of [Formula: see text]. The zero-divisor graph of [Formula: see text] with respect to [Formula: see text], denoted by [Formula: see text], is the graph whose vertices are the set [Formula: see text] with distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. The cozero-divisor graph [Formula: see text] of [Formula: see text] is the graph whose vertices are precisely the non-zero, non-unit elements of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and [Formula: see text]. In this paper, we introduced and investigated a new generalization of the cozero-divisor graph [Formula: see text] of [Formula: see text] denoted by [Formula: see text]. In fact, [Formula: see text] is a dual notion of [Formula: see text].

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-08-21
DOI
https://doi.org/10.1142/s1793830924500733
Citations
1
Primary Topic
Rings, Modules, and Algebras
Type
article
Field-Weighted Citation Impact
1.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A generalization of the cozero-divisor graph of a commutative ring

F. Farshadifar
1 citations
Discrete Mathematics Algorithms and Applications
Rings, Modules, and Algebras
1.27
article

A generalization of the cozero-divisor graph of a commutative ring

F. Farshadifar
article en
1 citations

Abstract

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be an ideal of [Formula: see text]. The zero-divisor graph of [Formula: see text] with respect to [Formula: see text], denoted by [Formula: see text], is the graph whose vertices are the set [Formula: see text] with distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. The cozero-divisor graph [Formula: see text] of [Formula: see text] is the graph whose vertices are precisely the non-zero, non-unit elements of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and [Formula: see text]. In this paper, we introduced and investigated a new generalization of the cozero-divisor graph [Formula: see text] of [Formula: see text] denoted by [Formula: see text]. In fact, [Formula: see text] is a dual notion of [Formula: see text].

Discrete Mathematics Algorithms and ApplicationsVol. 17(05)
Farhangian University (IR)
Openalex Percentile: Top 22%
Rings, Modules, and Algebras
1.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.