加载中…
Assume that is a graph with cover ideal . For every integer , we denote the -th symbolic power of by . We provide a sharp upper bound for the regularity of in terms of the star packing number of . Also, for any integer , we study the difference between and . As a consequence, we compute the regularity of when is a doubly Cohen-Macaulay graph. Furthermore, we determine if is either a Cameron-Walker graph or a claw-free graph which has no cycle of length other that and .

生成讲解博客的中文版本

生成AI智能校验的中文版本