Volume 13, Issue 1 (5-2018)                   IJMSI 2018, 13(1): 131-138 | Back to browse issues page

XML Print


In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.

Type of Study: Research paper | Subject: Special