A new construction for Cohen-Macaulay graphs
Commutative Algebra
2013-10-14 v1 Combinatorics
Abstract
Let be a finite simple graph on a vertex set . Also let be integers and be connected simple graphs on the vertex sets . In this paper, we provide necessary and sufficient conditions on for which the graph obtained by attaching to is unmixed or vertex decomposable. Then we characterize Cohen--Macaulay and sequentially Cohen--Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to an arbitrary graphs.
Cite
@article{arxiv.1310.2872,
title = {A new construction for Cohen-Macaulay graphs},
author = {Amir Mousivand and Seyed Amin Seyed Fakhari and Siamak Yassemi},
journal= {arXiv preprint arXiv:1310.2872},
year = {2013}
}
Comments
9 pages, 2 figures