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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Leaky-forcing is a recently introduced variant of zero-forcing that has beenstudied for families of graphs including paths, cycles, wheels, grids, andtrees. In this paper, we extend previous results on the leaky forcing number ofthe d-dimensional hypercube, $Q_d$, to show that the $(d-2)$-leaky forcingnumber of $Q_d$ is at most $2^{d-1}$. We also examine a question about therelationship between the size of a minimum $\ell$-leaky-forcing set and aminimum zero-forcing set for a graph $G$.

Upper bound for the $(d-2)$-leaky forcing number of $Q_d$ and $\ell$-leaky forcing number of $GP(n,1)$