EUVIMEDEUVIMED entdecken
Crossref

Shellability of Polyhedral Joins of Simplicial Complexes and Its Application to Graph Theory

Kengo Okura

The Electronic Journal of Combinatorics · 09.09.2022 · 29 (3)

DOI: 10.37236/11295 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 09.09.2022. Verfasst von Kengo Okura. Die Arbeit wurde bisher 2-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We investigate the shellability of the polyhedral join $\mathcal{Z}^*_M (K, L)$ of simplicial complexes $K, M$ and a subcomplex $L \subset K$. We give sufficient conditions and necessary conditions on $(K, L)$ for $\mathcal{Z}^*_M (K, L)$ being shellable. In particular, we show that for some pairs $(K, L)$, $\mathcal{Z}^*_M (K, L)$ becomes shellable regardless of whether $M$ is shellable or not. Polyhedral joins can be applied to graph theory as the independence complex of a certain generalized version of lexicographic products of graphs which we define in this paper. The graph obtained from two graphs $G, H$ by attaching one copy of $H$ to each vertex of $G$ is a special case of this generalized lexicographic product and we give a result on the shellability of the independence complex of this graph by applying the above results.

Zitieren

APA

Okura, K. (2022). Shellability of Polyhedral Joins of Simplicial Complexes and Its Application to Graph Theory. The Electronic Journal of Combinatorics, 29(3). https://doi.org/10.37236/11295

Vancouver

Okura K. Shellability of Polyhedral Joins of Simplicial Complexes and Its Application to Graph Theory. The Electronic Journal of Combinatorics. 2022;29(3). doi:10.37236/11295

BibTeX
@article{Okura2022,
  author = {Okura, Kengo},
  title = {Shellability of Polyhedral Joins of Simplicial Complexes and Its Application to Graph Theory},
  journal = {The Electronic Journal of Combinatorics},
  year = {2022},
  volume = {29},
  number = {3},
  doi = {10.37236/11295}
}
Kostenlos starten →