加载中…
Assume that is a graph with edge ideal . For every integer , we denote the squarefree part of the -th symbolic power of by . We determine an upper bound for the regularity of when is a chordal graph. If is a Cameron-Walker graphs, we compute in terms of the induced matching number of . Moreover, for any graph , we provide sharp upper bounds for and .

生成讲解博客的中文版本

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