2014
DOI: 10.1080/00927872.2012.749886
|View full text |Cite
|
Sign up to set email alerts
|

Cohen–Macaulay Circulant Graphs

Abstract: Abstract. Let G be the circulant graph C n (S) with S ⊆ {1, 2, . . . , ⌊ n 2 ⌋}, and let I(G) denote its the edge ideal in the ring R = k[x 1 , . . . , x n ]. We consider the problem of determining when G is Cohen-Macaulay, i.e, R/I(G) is a Cohen-Macaulay ring. Because a Cohen-Macaulay graph G must be well-covered, we focus on known families of wellcovered circulant graphs of the form C n (1, 2, . . . , d). We also characterize which cubic circulant graphs are Cohen-Macaulay. We end with the observation that e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
23
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 21 publications
(25 citation statements)
references
References 17 publications
2
23
0
Order By: Relevance
“…In this note we give explicit formulas for reg(I(G)) for the edge ideals of two infinite families of circulant graphs. Our results complement previous work on the algebraic and combinatorial topological properties of circulant graphs (e.g, [4,12,14,15,16,17,18]). Fix an integer n ≥ 1 and a subset S ⊆ {1, .…”
Section: Introductionsupporting
confidence: 88%
“…In this note we give explicit formulas for reg(I(G)) for the edge ideals of two infinite families of circulant graphs. Our results complement previous work on the algebraic and combinatorial topological properties of circulant graphs (e.g, [4,12,14,15,16,17,18]). Fix an integer n ≥ 1 and a subset S ⊆ {1, .…”
Section: Introductionsupporting
confidence: 88%
“…We focused on the property of n, but nice combinatorial properties like well-coveredness (see [7], [5]), strongly connectedness (see [10]), vertex decomposability and shellability (see [12]) could be helpful. From another point of view, it would be nice to find entire classes of circulants that for particular n and S have vanishing Euler characteristic, by using a theoretical approach rather than the computational one used in Example 2.10.…”
Section: )mentioning
confidence: 99%
“…Theorem 3.3 shows that the independence complexes of these graphs are always Buchsbaum. In addition, we classify when these complexes are vertex decomposable, solving an open problem of [29]. We also include a discussion on the h-vectors of Buchsbaum complexes.…”
Section: Introductionmentioning
confidence: 99%
“…Finally, we would like to add a small erratum to [29]. On page 1902, the f -vector and hvector on line 4 should be (1,11,33,22), respectively, (1,8,14 [17] contained a proof for the equivalence of Theorem 3.4 (ii) and (iv) of [29].…”
Section: Introductionmentioning
confidence: 99%