the regularity of binomial edge ideals of graphs
|
|
|
|
|
|
|
|
نویسنده
|
kiani dariush ,saeedi madani sara
|
|
منبع
|
aut journal of mathematics and computing - 2020 - دوره : 1 - شماره : 2 - صفحه:217 -221
|
|
چکیده
|
In this paper, we study the castelnuovo-mumford regularity and the graded betti numbers of the binomial edge ideals of some classes of graphs. our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of its binomial edge ideal.
|
|
کلیدواژه
|
binomial edge ideal ,castelnuovo-mumford regularity ,free cut edge
|
|
آدرس
|
amirkabir university of technology (tehran polytechnic), faculty of mathematics and computer science, iran, amirkabir university of technology (tehran polytechnic), faculty of mathematics and computer science, iran
|
|
پست الکترونیکی
|
sarasaeedi@aut.ac.ir
|
|
|
|
|
|
|