Algebraic study on Cameron-Walker graphs

From MaRDI portal
Publication:471882

DOI10.1016/J.JALGEBRA.2014.07.037zbMATH Open1303.05218arXiv1308.4765OpenAlexW2963407442MaRDI QIDQ471882FDOQ471882


Authors: Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine O'keefe Edit this on Wikidata


Publication date: 17 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Let G be a finite simple graph on [n] and I(G)subsetS the edge ideal of G, where S=K[x1,ldots,xn] is the polynomial ring over a field K. Let m(G) denote the maximum size of matchings of G and im(G) that of induced matchings of G. It is known that im(G)leqextreg(S/I(G))leqm(G), where extreg(S/I(G)) is the Castelnuovo-Mumford regularity of S/I(G). Cameron and Walker succeeded in classifying the finite connected simple graphs G with im(G)=m(G). We say that a finite connected simple graph G is a Cameron-Walker graph if im(G)=m(G) and if G is neither a star nor a star triangle. In the present paper, we study Cameron-Walker graphs from a viewpoint of commutative algebra. First, we prove that a Cameron-Walker graph G is unmixed if and only if G is Cohen-Macaulay and classify all Cohen-Macaulay Cameron-Walker graphs. Second, we prove that there is no Gorenstein Cameron-Walker graph. Finally, we prove that every Cameron--Walker graph is sequentially Cohen-Macaulay.


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




Recommendations




Cites Work


Cited In (36)





This page was built for publication: Algebraic study on Cameron-Walker graphs

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