On the Extended and Annihilator Zero-Divisor Graphs of Direct Products of Commutative Rings

Let R=A×B be a direct product of nonzero finite commutative rings with identity. We compare the classical zero-divisor graph Γ(R), the annihilator graph AG(R), and a principal-ideal–annihilator intersection graph Γ¯(R), explicitly distinguishing the last construction from power-based extended zero-divisor graphs in the literature. We establish an edge-inclusion hierarchy, recover the complete bipartite description for products of domains, and explain the known diameter bound through the classical zero-divisor graph. For finite products we characterize completeness: AG(R) is complete precisely for R≅F2×F2, while Γ¯(R) is complete precisely when R is Boolean. We give explicit strict-inclusion examples, compute girth in the domain-product case, and examine automorphisms and twin vertices, including a support-set description for Boolean rings. These results clarify which properties follow from established zero-divisor graph theory and which depend on the additional adjacency relations.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-11-17
DOI
https://doi.org/10.3390/axioms15110857
Primary Topic
Rings, Modules, and Algebras
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

On the Extended and Annihilator Zero-Divisor Graphs of Direct Products of Commutative Rings

Mohamed Bouye
Axioms
Rings, Modules, and Algebras
article

On the Extended and Annihilator Zero-Divisor Graphs of Direct Products of Commutative Rings

Mohamed Bouye
article en

Abstract

Let R=A×B be a direct product of nonzero finite commutative rings with identity. We compare the classical zero-divisor graph Γ(R), the annihilator graph AG(R), and a principal-ideal–annihilator intersection graph Γ¯(R), explicitly distinguishing the last construction from power-based extended zero-divisor graphs in the literature. We establish an edge-inclusion hierarchy, recover the complete bipartite description for products of domains, and explain the known diameter bound through the classical zero-divisor graph. For finite products we characterize completeness: AG(R) is complete precisely for R≅F2×F2, while Γ¯(R) is complete precisely when R is Boolean. We give explicit strict-inclusion examples, compute girth in the domain-product case, and examine automorphisms and twin vertices, including a support-set description for Boolean rings. These results clarify which properties follow from established zero-divisor graph theory and which depend on the additional adjacency relations.

AxiomsVol. 15(11)
King Khalid University (SA)
Rings, Modules, and Algebras
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.

Laika access coming soon