Boolean graphs are unmixed and vertex decomposable

Abstract

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.

corrected several mistakes and misspells

References in corpus (2)

• Vertex decomposable graphs and obstructions to shellability
• Strong shellability of simplicial complexes