Whiskers and sequentially Cohen-Macaulay graphs

From MaRDI portal
Publication:2474498

DOI10.1016/J.JCTA.2007.06.004zbMATH Open1142.13021arXivmath/0605487OpenAlexW1984446703MaRDI QIDQ2474498FDOQ2474498


Authors: Christopher A. Francisco, Huy Tài Hà Edit this on Wikidata


Publication date: 6 March 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Let G be a simple (i.e., no loops and no multiple edges) graph. We investigate the question of how to modify G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on modifications given by adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex in G. We give various sufficient conditions and necessary conditions on a subset S of the vertices of G so that the graph G cup W(S), obtained from G by adding a whisker to each vertex in S, is a sequentially Cohen-Macaulay graph. For instance, we show that if S is a vertex cover of G, then G cup W(S) is a sequentially Cohen-Macaulay graph. On the other hand, we show that if G �ackslash S is not sequentially Cohen-Macaulay, then G cup W(S) is not a sequentially Cohen-Macaulay graph. Our work is inspired by and generalizes a result of Villarreal on the use of whiskers to get Cohen-Macaulay graphs.


Full work available at URL: https://arxiv.org/abs/math/0605487




Recommendations




Cites Work


Cited In (41)

Uses Software





This page was built for publication: Whiskers and sequentially Cohen-Macaulay graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474498)