  For each Boolean graph $B_n$, it is proved that both $B_n$ and its complement
graph $\overline{B_n}$ are vertex decomposable. It is also proved that $B_n$ is
an unmixed graph, thus it is also Cohen-Macaulay.
