@article{Article_66,

title = {Semisimple-Intersection Graphs of Ideals of Rings},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2023},

issue = {2},

issn = { 2783-5456 },

year = {2023},

url = {http://cccs.sgh.ac.ir/Articles/2023/issue 2/2-6-SemisimpleIntersectionGraphsIdealsRings.pdf},

author = {Ahmed H. Alwan},

keywords = {Semisimple-intersection graph; rings; ideals; clique number; girth; diameter.},

abstract = {In this paper, a new kind of graph on a ring is introduced and investigated. Let R be a ring with unity. Semisimpleintersection graph of a ring R, denoted by GS(R), is an undirected simple graph with all nonzero ideals of R as vertices and two distinct vertices I and J are adjacent if and only if I ∩ J is a nonzero semisimple ideal of R. In this article, we investigate the basic properties of these graphs to relate the combinatorial properties of GS(R) to the algebraic properties of the ring R. We determine the diameter and the girth of GS(R). We obtain some results for connectedness and bipartiteness of these graphs, as well as give a formula to compute the clique numbers of GS(R). We observed that the graph GS(R) is complete if and only if every proper ideal of R either simple or semisimple and every pair of ideals in R have non-zero intersection.}

};