Name
Abstract | ||
|---|---|---|
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 in finite family of graphs whose independence complexes are shellable but not vertex decomposable. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.11575/cdm.v12i2.62777 | CONTRIBUTIONS TO DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
independence complex,vertex decomposable,shellable,circulant graphs | Journal | 12 |
Issue | ISSN | Citations |
2 | 1715-0868 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin N. Vander Meulen | 1 | 17 | 5.27 |
| Adam Van Tuyl | 2 | 15 | 4.32 |