intersection graphs associated with semigroup acts

The intersection graph int(a) of an s-act a over a semigroup s is an undirected simple graph whose vertices are non-trivial subacts of a, and two distinct vertices are adjacent if and only if they have a nonempty intersection. in this paper, we study some graph-theoretic properties of int(a) in connection to some algebraic properties of a. it is proved that the finiteness of each of the clique number, the chromatic number, and the degree of some or all vertices in int(a) is equivalent to the finiteness of the number of subacts of a. finally, we determine the clique number of the graphs of certain classes of s-acts.