Title
On well-covered, vertex decomposable and Cohen-Macaulay graphs
Abstract
Let G = (V, E) be a graph. If G is a Konig graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: Delta(G) is pure shellable, R/I-Delta is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of Konig type e(1),...,e(g) without 4-cycles with two ei's. Furthermore, we study vertex decomposable and shellable (non-pure) properties in graphs without 3-cycles and 5-cycles. Finally, we give some properties and relations between critical, extendable and shedding vertices.
Year
Venue
Keywords
2016
ELECTRONIC JOURNAL OF COMBINATORICS
Cohen-Macaulay,shellable,well-covered,unmixed,vertex decomposable,Konig,girth
Field
DocType
Volume
Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Vertex (graph theory),Neighbourhood (graph theory),Matching (graph theory),Mathematics
Journal
23
Issue
ISSN
Citations 
2.0
1077-8926
3
PageRank 
References 
Authors
0.40
5
3
Name
Order
Citations
PageRank
ivan dario castrillon130.40
Roberto Cruz2113.48
Enrique Reyes3214.56