Semigroup up of Graphs Over a Boolean Algebra

Abstract

In this paper, we considered two types of semigroup say bA and Mn[0,1] for the given directed graph D=(V,A) and mainly try to
show that the above two semigroups are isomorphic to each other. Further we study the class of reduced idempotent in bA coincide with the
class of partial order relation on a vertex set of disubgraph of D.