English

A new construction for Cohen-Macaulay graphs

Commutative Algebra 2013-10-14 v1 Combinatorics

Abstract

Let GG be a finite simple graph on a vertex set V(G)={x11,,xn1}V(G)=\{x_{11}, \ldots, x_{n1}\}. Also let m1,,mn2m_1, \ldots,m_n \geq 2 be integers and G1,,GnG_1, \ldots, G_n be connected simple graphs on the vertex sets V(Gi)={xi1,,ximi}V(G_i)=\{x_{i1}, \ldots, x_{im_i}\}. In this paper, we provide necessary and sufficient conditions on G1,,GnG_1, \ldots, G_n for which the graph obtained by attaching GiG_i to GG 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.

Keywords

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

R2 v1 2026-06-22T01:44:20.823Z