Shellability, vertex decomposability, and lexicographical products of graphs

Contributions to Discrete Mathematics

Kevin N Vander Meulen ; Adam Van Tuyl

关键词: independence complex, vertex decomposable, shellable, circulant graphs;   

学科分类：社会科学、人文和艺术（综合）

来源: University of Calgary * Department of Mathematics and Statistics

【 摘 要 】

In this note we describe 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 show that there exists an infinite family ofgraphs whose independence complexes are shellable but not vertexdecomposable.

【 授权许可】

Unknown