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

preprint2015arXivOpen access

Abstract

Let G=(V,E)G=(V,E) be a graph. If GG is a König graph or GG is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: ΔGΔ_{G} is pure shellable, R/IΔR/I_Δ is Cohen-Macaulay, GG is unmixed vertex decomposable graph and GG is well-covered with a perfect matching of König type e1,...,ege_{1},...,e_{g} without square with two eie_i'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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.