Independence Complexes of Well-Covered Circulant Graphs

References

• [Adamaszek 12] M. Adamaszek. “Splittings of Independence Complexes and the Powers of Cycles.” Combin. Theory Ser. A 119 (2012), 1031–1047.
   Web of Science ®Google Scholar
• [Boros et al. 14] E. Boros, V. Gurvich, and M. Milanič. “On CIS Circulants.” Discrete Math. 318 (2014), 78–95.
   Web of Science ®Google Scholar
• [Brown and Hoshino 09] J. Brown and R. Hoshino. “Independence Polynomials of Circulants with an Application to Music.” Discrete Math. 309 (2009), 2292–2304.
   Web of Science ®Google Scholar
• [Brown and Hoshino 11] J. Brown and R. Hoshino. “Well-Covered Circulant Graphs.” Discrete Math. 311 (2011), 244–251.
   Web of Science ®Google Scholar
• [Cook 10] D. Cook II. “Simplicial Decomposability.” J. Softw. Algebra Geom. 2 (2010), 20–23.
   Google Scholar
• [Cook and Nagel 12] D. Cook II and U. Nagel. “Cohen-Macaulay Graphs and Face Vectors of Flag Complexes.” SIAM J. Discrete Math. 26 (2012), 89–101.
   Web of Science ®Google Scholar
• [Dochtermann and Engström 09] A. Dochtermann and A. Engström. “Algebraic Properties of Edge Ideals Via Combinatorial Topology.” Electron. J. Combin. 16: 2 (2009), Special volume in honor of Anders Björner, Research Paper 2, 24pp.
   Web of Science ®Google Scholar
• [Eastman 14] B. Eastman. “Circulant—LaTeX Code.” GitHub Repository. Available online https://github.com/brydon/circulant, 2014.
   Google Scholar
• [Estrada and Villarreal 97] M. Estrada and R. Villarreal. “Cohen-Macaulay Bipartite Graphs.” Arch. Math. (Basel) 68 (1997), 124–128.
   Web of Science ®Google Scholar
• [Francisco et al. 09] C. Francisco, A. Hoefel, and A. Van Tuyl. “EdgeIdeals: A Package for (Hyper)Graphs.” J. Softw. Algebra Geom. 1 (2009), 1–4.
   Google Scholar
• [Grayson and Stillman] D. R. Grayson and M. E. Stillman. “Macaulay 2, A Software System for Research in Algebraic Geometry.” Available at http://www.math.uiuc.edu/Macaulay2/.
   Google Scholar
• [Herzog and Hibi 11] J. Herzog and T. Hibi. Monomial ideals, Graduate Texts in Mathematics, 260. LondonSpringer-Verlag, 2011.
   Google Scholar
• [Herzog and Hibi 05] J. Herzog and T. Hibi. “Distributive Lattices, Bipartite Graphs and Alexander Duality.” J. Algebraic Combin. 22 (2005), 289–302.
   Web of Science ®Google Scholar
• [Herzog et al. 06] J. Herzog, T. Hibi, and X. Zheng. “Cohen-Macaulay Chordal Graphs.” J. Combin. Theory Ser. A 113 (2006), 911–916.
   Web of Science ®Google Scholar
• [Hibi et al. 15] T. Hibi, A. Higashitani, K. Kimura, and A. B. O’Keefe. “Algebraic Study on Cameron-Walker Graphs.” J. Algebra 422 (2015), 257–269.
   Web of Science ®Google Scholar
• [Hoshino 07] R. Hoshino. “Independence Polynomials of Circulant Graphs.” Ph.D. thesis, Dalhousie University, 2007.
   Google Scholar
• [Kozlov 99] D. N. Kozlov. “Complexes of Directed Trees.” J. Combin. Theory Ser. A 88 (1999), 112–122.
   Web of Science ®Google Scholar
• [Mahmoudi et al. 11] M. Mahmoudi, A. Mousivand, M. Crupi, G. Rinaldo, N. Terai, and S. Yassemi. “Vertex Decomposability and Regularity of Very Well-Covered Graphs.” J. Pure Appl. Algebra 215 (2011), 2473–2480.
   Web of Science ®Google Scholar
• [Morey and Villarreal 12] S. Morey and R. Villarreal. “Edge Ideals: Algebraic and Combinatorial Properties.” In Progress in Commutative Algebra, vol. 1, edited by C. Francisco, L.C. Klingler, S. Sather-Wagstaff, and J.C. Vassilev, pp. 85–126. Berlin: de Gruyter, 2012.
   Google Scholar
• [Moriyama and Takeuchi 03] S. Moriyama and F. Takeuchi. “Incremental Construction Properties in Dimension Two-Shellability, Extendable Shellability and Vertex Decomposability.” Discrete Math. 263 (2003), 295–296.
   Web of Science ®Google Scholar
• [Moussi 12] R. Moussi. “A Characterization of Certain Families of Well-Covered Circulant Graphs.” M.Sc. thesis, St. Mary’s University, 2012.
   Google Scholar
• [Plummer 93] M. Plummer. “Well-Covered Graphs: A Survey.” Quaestiones Math. 16 (1993), 253–287.
   Google Scholar
• [Provan and Billera 80] J. Provan and L. Billera. “Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra.” Math. Oper. Res. 5 (1980), 576–594.
   Web of Science ®Google Scholar
• [Sabzrou et al. 08] H. Sabzrou, M. Tousi, and S. Yassemi. “Simplicial Join Via Tensor Product.” Manuscripta Math. 126: 2 (2008), 255–272.
   Web of Science ®Google Scholar
• [Staples 75] J. A. W. Staples. “On Some Subclasses of Well-Covered Graphs.” Ph.D. thesis, Vanderbilt University, 1975.
   Google Scholar
• [Stein et al. 14] W. A. Stein et al. “Sage Mathematics Software (Version 6.2).” The Sage Development Team. Available at http://www.sagemath.org, 2014.
   Google Scholar
• [Vander Meulen and Van Tuyl 15] K. N. Vander Meulen and A. Van Tuyl. “Shellability, Vertex Decomposability, and Lexicographical Products of Graphs.” arXiv preprint, arXiv:1505.02838, 2015.
   Google Scholar
• [Vander Meulen et al. 14] K. N. Vander Meulen, A. Van Tuyl, and C. Watt. “Cohen-Macaulay Circulant Graphs.” Comm. Algebra 42 (2014), 1896–1910.
   Web of Science ®Google Scholar
• [Van Tuyl 09] A. Van Tuyl. “Sequentially Cohen-Macaulay Bipartite Graphs: Vertex Decomposability and Regularity.” Arch. Math. (Basel) 93 (2009), 451–459.
   Web of Science ®Google Scholar
• [Villarreal 90] R. H. Villarreal. “Cohen-Macaulay Graphs.” Manuscripta Math. 66 (1990), 277–293.
   Web of Science ®Google Scholar
• [Villarreal 01] R. H. Villarreal. Monomial algebras, Monographs and Textbooks in Pure and Applied Mathematics, vol. 238. New York, NY: Marcel Dekker, 2001.
   Google Scholar
• [Walkup 78] D. Walkup. “The Hirsch Conjecture Fails for Triangulated 27-Spheres.” Math. Oper. Res. 3: 3 (1978), 224–230.
   Google Scholar
• [Woodroofe 09] R. Woodroofe. “Vertex Decomposable Graphs and Obstructions to Shellability.” Proc. Amer. Math. Soc. 137 (2009), 3235–3246.
   Web of Science ®Google Scholar
• [Woodroofe 11] R. Woodroofe. “Chordal and Sequentially Cohen-Macaulay Clutters.” Electron. J. Combin. 18: 1 (2011), Paper 208, 20pp.
   Web of Science ®Google Scholar