Sequentially Cohen-Macaulay graphs of form $\theta$n1,..., nk
- Author
- Fatemeh Mohammadi (UGent) and D Kiani
- Organization
- Abstract
- Let k be an integer greater than 2 and n(1),..., n(k) be a sequence of positive integers with at most one of them being equal to 1. Let theta(n1),...,(nk) be a graph consisting of k paths, having only their endpoints in common. We characterize all sequentially Cohen-Macaulay graphs of this type. We also show for these types of graphs the notions of vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent.
- Keywords
- Sequentially Cohen-Macaulay graph, shellable graph, SHELLABLE NONPURE COMPLEXES, OBSTRUCTIONS, IDEALS, POSETS
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8667492
- MLA
- Mohammadi, Fatemeh, and D. Kiani. “Sequentially Cohen-Macaulay Graphs of Form $\theta$n1,..., Nk.” BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, vol. 36, no. 2, Citeseer, 2010, pp. 109–18.
- APA
- Mohammadi, F., & Kiani, D. (2010). Sequentially Cohen-Macaulay graphs of form $\theta$n1,..., nk. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 36(2), 109–118.
- Chicago author-date
- Mohammadi, Fatemeh, and D Kiani. 2010. “Sequentially Cohen-Macaulay Graphs of Form $\theta$n1,..., Nk.” BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY 36 (2): 109–18.
- Chicago author-date (all authors)
- Mohammadi, Fatemeh, and D Kiani. 2010. “Sequentially Cohen-Macaulay Graphs of Form $\theta$n1,..., Nk.” BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY 36 (2): 109–118.
- Vancouver
- 1.Mohammadi F, Kiani D. Sequentially Cohen-Macaulay graphs of form $\theta$n1,..., nk. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY. 2010;36(2):109–18.
- IEEE
- [1]F. Mohammadi and D. Kiani, “Sequentially Cohen-Macaulay graphs of form $\theta$n1,..., nk,” BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, vol. 36, no. 2, pp. 109–118, 2010.
@article{8667492,
abstract = {{Let k be an integer greater than 2 and n(1),..., n(k) be a sequence of positive integers with at most one of them being equal to 1. Let theta(n1),...,(nk) be a graph consisting of k paths, having only their endpoints in common. We characterize all sequentially Cohen-Macaulay graphs of this type. We also show for these types of graphs the notions of vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent.}},
author = {{Mohammadi, Fatemeh and Kiani, D}},
issn = {{1735-8515}},
journal = {{BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY}},
keywords = {{Sequentially Cohen-Macaulay graph,shellable graph,SHELLABLE NONPURE COMPLEXES,OBSTRUCTIONS,IDEALS,POSETS}},
language = {{eng}},
number = {{2}},
pages = {{109--118}},
publisher = {{Citeseer}},
title = {{Sequentially Cohen-Macaulay graphs of form $\theta$n1,..., nk}},
volume = {{36}},
year = {{2010}},
}