semi square stable graphs and efficient dominating sets

A graph g is called semi square stable if α (g²) = i(g) where α(g²) is the independence number of g² and i(g) is the independent dominating number of g. a subset s of the vertex set of a graph g is an efficient dominating set if s is an independent set and every vertex of g is either in s or adjacent to exactly one vertex of s. in this paper, we show that every square stable graph has an efficient dominating set and if a graph has an efficient dominating set, then it is semi square stable. we characterize when the join and the corona product of two disjoint graphs are semi square sable graphs and when they have efficient dominating sets.