Vertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which i...
Main Author: | Somayeh Moradi |
---|---|
Format: | Article |
Language: | fas |
Published: |
Kharazmi University
2019-08-01
|
Series: | پژوهشهای ریاضی |
Subjects: | |
Online Access: | http://mmr.khu.ac.ir/article-1-2601-en.html |
Similar Items
-
Recursively arbitrarily vertex-decomposable graphs
by: Olivier Baudon, et al.
Published: (2012-01-01) -
On some families of arbitrarily vertex decomposable spiders
by: Tomasz Juszczyk, et al.
Published: (2010-01-01) -
End Simplicial Vertices in Path Graphs
by: Gutierrez Marisa, et al.
Published: (2016-05-01) -
A note on arbitrarily vertex decomposable graphs
by: Antoni Marczyk
Published: (2006-01-01) -
A new construction for vertex decomposable graphs
by: Nasser Hajisharifi, et al.
Published: (2016-09-01)