COMAXIMAL INTERSECTION GRAPH OF IDEALS OF RINGS.

The comaximal intersection graph CI(R) of ideals of a ring R is an undirected graph whose vertex set is the collection of all non-trivial (left) ideals of R and any two vertices I and J are adjacent if and only if I + J = R and I ∩ J 6= 0. We study the connectedness of CI(R). We also discuss independence number, clique number, domination number, chromatic number of CI(R). [ABSTRACT FROM AUTHOR]