Boolean graphs are unmixed and vertex decomposable
Abstract
For each Boolean graph Bn, it is proved that both Bn and its complement graph Bn are vertex decomposable. It is also proved that Bn is an unmixed graph, thus it is also Cohen-Macaulay.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.