Shellable and Cohen-Macaulay complete t-partite graphs

2012/04/10 by Seyyede Masoome Seyyedi, Seyyedi, Seyyede Masoome, Farhad Rahmati +3
Mathematics · #05D38 #13C14 #13D02 #52B22 #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #math.AC #math.CO #msc:05D38 #msc:13C14 #msc:13D02 #msc:52B22

paper · pdf · doi:10.48550/arxiv.1204.2112

6 pages

arxiv created 2012/05/26 · arxiv updated 2012/05/29

Abstract

Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent condition for Cohen-Macaulay in complete t-partite graphs.

Related

• Vertex decomposability, shellability and Cohen-Macaulayness of graphs upon graph operations
• On well-covered, vertex decomposable and Cohen-Macaulay graphs
• Vertex decomposability and regularity of very well-covered graphs
• Chordal graphs, higher independence and vertex decomposable complexes
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs