On well-covered, vertex decomposable and Cohen-Macaulay graphs

Abstract

Let G=(V,E) be a graph. If G is a K\"onig graph or G is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: G is pure shellable, R/I is Cohen-Macaulay, G is unmixed vertex decomposable graph and G is well-covered with a perfect matching of K\"onig type e1,...,eg without square with two ei's. We characterize well-covered graphs without 3-cycles, 5-cycles and 7-cycles. Also, we study when graphs without 3-cycles and 5-cycles are vertex decomposable or shellable. Furthermore, we give some properties and relations between critical, extendables and shedding vertices. Finally, we characterize unicyclic graphs with each one of the following properties: unmixed, vertex decomposable, shellable and 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.

Discussion (0)

Sign in to join the discussion.

Loading comments…