In this paper, we discuss some relations between the semigroup, Bin(X), of all groupoids (X,∗) and graphs. We discuss mimimum (mutual) covering sets in several groupoids and discuss distances of graphs with groupoids. Finally, we obtain some results on frame graphs with groupoids.