The Inclusion Ideal Graph of Rings

Abstract

Let R be a ring with unity. The inclusion ideal graph of a ring R, denoted by In(R), is a graph whose vertices are all nontrivial left ideals of R and two distinct left ideals I and J are adjacent if and only if I ⊂ J or J ⊂ I. In this paper, we show that In(R) is not connected if and only if R ≅ M 2(D) or D 1 × D 2, for some division rings, D, D 1 and D 2. Moreover, we prove that if In(R) is connected, then diam(In(R)) ≤3. It is shown that if In(R) is a tree, then In(R) is a caterpillar with diam(In(R)) ≤3. Also, we prove that the girth of In(R) belongs to the set {3, 6, ∞}. Finally, we determine the clique number and the chromatic number of the inclusion ideal graph for some classes of rings.