|
|
|
|
line graphs with a sequentially cohen-macaulay clique complex
|
|
|
|
|
|
|
|
نویسنده
|
nikseresht ashkan
|
|
منبع
|
پنجاه و يكمين كنفرانس رياضي ايران - 1399 - دوره : 51 - پنجاه و یکمین کنفرانس ریاضی ایران - کد همایش: 99201-37641 - صفحه:0 -0
|
|
چکیده
|
Let h be a simple undirected graph and g = l(h) be its linegraph. assume that ä(g) denotes the clique complex of g. we show thatä(g) is sequentially cohen-macaulay if and only if it is shellable if and only ifit is vertex decomposable. furthermore, we state a complete characterizationof those h for which ä(g) is sequentially cohen-macaulay.
|
|
کلیدواژه
|
line graph ,stanley-reisner ideal ,sequentially cohen-macaulayness ,edge ideal ,squarefree monomial ideal
|
|
آدرس
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|