A generalization of zero-divisor graphs
Peyman Nasehpour

TL;DR
This paper introduces a new family of graphs extending zero-divisor graphs, analyzes their structural properties including diameter, cycles, and cores, and provides bounds and insights into their topology.
Contribution
It generalizes zero-divisor graphs and explores their properties, including diameter bounds, cycles, and cores, offering new insights into their structure.
Findings
Computed an upper bound for the diameter of the generalized graphs
Analyzed the cycles and cores of these graphs
Provided structural insights into the topology of the generalized graphs
Abstract
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Advanced Topics in Algebra · Algebraic structures and combinatorial models
