Constructing vertex decomposable graphs
دریافت مدرک
FullText
اندازه فایل:
194.1کیلوبایتنوع فايل (MIME):
PDFنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
کلید واژگان
Finite graphwell-covered graph
independence complex
edge ideal
vertex decomposable graph
13-XX Commutative algebra
شماره نشریه
4تاریخ نشر
2016-08-011395-05-11
ناشر
Springer and the Iranian Mathematical Society (IMS)سازمان پدید آورنده
Department of Mathematics, Science and Research branch, Islamic Azad University(IAU), Tehran, Iran.Department of Mathematics, University of Kurdistan, P.O. Box 66177-15175, Sanadaj, Iran.
شاپا
1017-060X1735-8515
