Answers are grounded in this paper and cite their sources.
In this article, we introduce and study the intersection graph of graded ideals of a graded ring. The intersection graph of $ G- $graded ideals of a graded ring R, denoted by GrG(R), is undirected simple graph defined on the set of nontrivial graded left ideals of R, such that two left ideals are adjacent if their intersection is not trivial. We study properties for these graphs such as connectivity, regularity, completeness, domination numbers, and girth. We also present several results on the intersection graphs related to faithful grading, strong grading, and graded idealization.
No takes yet. Share an insight, caveat, or question.
Alraqad et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: