Shellability, vertex decomposability, and lexicographical products of graphs

MaRDI QIDQ4598367zbMATH OpenFDO

Authors Kevin N. Vander Meulen, Adam Van Tuyl

Publication date 20 December 2017

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

zbMATH Keywords

vertex decomposablecirculant graphsshellableindependence complex

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Abstract: We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that every graph in this family has the property that the independence complex of each graph is shellable, but not vertex decomposable.

Recommendations

• Vertex decomposable graphs and obstructions to shellability
• Shellability of polyhedral joins of simplicial complexes and its application to graph theory
• Shellable Cactus Graphs
• scientific article; zbMATH DE number 6478520
• Chordal graphs, higher independence and vertex decomposable complexes

Cited in

(6)

• Cohen-Macaulayness of two classes of circulant graphs
• Vertex decomposability, shellability and Cohen-Macaulayness of graphs upon graph operations
• Chordal graphs, higher independence and vertex decomposable complexes
• Shellability of polyhedral joins of simplicial complexes and its application to graph theory
• Vertex decomposable graphs and obstructions to shellability
• Betti numbers of some circulant graphs

This page was built for publication: Shellability, vertex decomposability, and lexicographical products of graphs

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