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

A configuration of a graph is an assignment of one of two states, on or off,to each vertex of it. A regular move at a vertex changes the states of theneighbors of that vertex. A valid move is a regular move at an on vertex. Thefollowing result is proved in this note: given any starting configuration $x$of a tree, if there is a sequence of regular moves which brings $x$ to anotherconfiguration in which there are $\ell$ on vertices then there must exist asequence of valid moves which takes $x$ to a configuration with at most $\ell+2$ on vertices. We provide example to show that the upper bound $\ell +2$ issharp. Some relevant results and conjectures are also reported.

Difference between minimum light numbers of sigma-game and lit-only sigma-game