English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

A Cameron-Walker graph is a graph for which the matching number and theinduced matching number are the same. Assume that $G$ is a Cameron-Walker graphwith edge ideal $I(G)$, and let $\ind-match(G)$ be the induced matching numberof $G$. It is shown that for every integer $s\geq 1$, we have the equality${\rm reg}(I(G)^{(s)})=2s+\ind-match(G)-1$, where $I(G)^{(s)}$ denotes the$s$-th symbolic power of $I(G)$.

Regularity of symbolic powers of edge ideals of Cameron-Walker graphs