On the reduced Euler characteristic of independence complexes of circulant graphs
DOI10.1016/J.DISC.2018.05.013zbMATH Open1392.05090arXiv1706.00863OpenAlexW2962912586WikidataQ129731745 ScholiaQ129731745MaRDI QIDQ724841FDOQ724841
Authors: Giancarlo Rinaldo, Francesco Romeo
Publication date: 26 July 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.00863
Recommendations
- On circulants uniquely characterized by their independence polynomials.
- Some results on the independence number of circulant graphs \(C(n; \{1,k\})\)
- Independence complexes of well-covered circulant graphs
- 2-Dimensional vertex decomposable circulant graphs
- Hard squares with negative activity on cylinders with odd circumference
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- Cohen-Macaulay graphs
- Combinatorics and commutative algebra.
- The Geometry of Syzygies
- Cohen-Macaulay circulant graphs
- On the location of roots of independence polynomials
- Monomial algebras
- Independence polynomials of circulants with an application to music
- Well-covered circulant graphs
- Independence complexes of well-covered circulant graphs
- Some algebraic invariants of edge ideal of circulant graphs
Cited In (1)
This page was built for publication: On the reduced Euler characteristic of independence complexes of circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724841)