Abstract
Let be a graph. If is a König graph or is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: is pure shellable, is Cohen-Macaulay, is unmixed vertex decomposable graph and is well-covered with a perfect matching of König type without square with two '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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.