A new construction for Cohen-Macaulay graphs
Abstract
Let G be a finite simple graph on a vertex set V(G)=\x11, …, xn1\. Also let m1, …,mn ≥ 2 be integers and G1, …, Gn be connected simple graphs on the vertex sets V(Gi)=\xi1, …, ximi\. In this paper, we provide necessary and sufficient conditions on G1, …, Gn for which the graph obtained by attaching Gi to G 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.