Cohen-Macaulayness of two classes of circulant graphs

DOI10.1007/s10801-020-00943-6zbMath1467.05210OpenAlexW3083818718MaRDI QIDQ2038889

Yanyan Li

Publication date: 7 July 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-020-00943-6

zbMATH Keywords

\(f\)-vectorcirculant graphwell-covered graphCohen-Macaulay graphGorenstein graphBuchsbaum graph

Mathematics Subject Classification ID

Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Structural characterization of families of graphs (05C75) Combinatorial aspects of simplicial complexes (05E45) Combinatorial aspects of commutative algebra (05E40)

Related Items (2)

A large class of graphs with a small subclass of Cohen–Macaulay members ⋮ Cohen-Macaulayness of a class of graphs versus the class of their complements

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
• On CIS circulants
• Well-covered circulant graphs
• On the reduced Euler characteristic of independence complexes of circulant graphs
• Independence polynomials of circulants with an application to music
• On the ideal theory of graphs
• Cohen-Macaulay graphs
• Combinatorics and commutative algebra.
• Cohen--Macaulay chordal graphs
• Distributive lattices, bipartite graphs and Alexander duality
• Union and glueing of a family of Cohen-Macaulay partially ordered sets
• Some algebraic invariants of edge ideal of circulant graphs
• Shellability, vertex decomposability, and lexicographical products of graphs
• The Geometry of Syzygies
• Monomial Algebras
• Cohen–Macaulay Circulant Graphs
• New binary coding results by circulants
• Independence Complexes of Well-Covered Circulant Graphs

This page was built for publication: Cohen-Macaulayness of two classes of circulant graphs