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

Let $G$ be a graph and $\tau$ be an assignment of nonnegative integerthresholds to the vertices of $G$. Denote the average of thresholds in $\tau$by $\bar{\tau}$. A subset of vertices $D$ is said to be a $\tau$-dynamicmonopoly, if $V(G)$ can be partitioned into subsets $D_0, D_1, \ldots, D_k$such that $D_0=D$ and for any $i\in \{0, \ldots, k-1\}$, each vertex $v$ in$D_{i+1}$ has at least $\tau(v)$ neighbors in $D_0\cup \ldots \cup D_i$. Denotethe size of smallest $\tau$-dynamic monopoly by $dyn_{\tau}(G)$. Also a subsetof vertices $M$ is said to be a $\tau$-static monopoly (or simply$\tau$-monopoly) if any vertex $v\in V(G)\setminus M$ has at least $\tau(v)$neighbors in $M$. Denote the size of smallest $\tau$-monopoly by$mon_{\tau}(G)$. For a given positive number $t$, denote by $Sdyn_t(G)$ (resp.$Smon_t(G)$), the minimum $dyn_{\tau}(G)$ (resp. $mon_{\tau}(G)$) among allthreshold assignments $\tau$ with $\overline{\tau}\geq t$. In this paper weconsider the concept of partial vertex cover as follows. Let $G=(V, E)$ be agraph and $t$ be any positive integer. A subset $S\subseteq V$ is said to be a$t$-partial vertex cover of $G$, if $S$ covers at least $t$ edges of $G$.Denote the smallest size of a $t$-partial vertex cover of $G$ by $P\beta_t(G)$.Let $\rho$, $0<\rho<1$ be any fixed number and $G$ be a given bipartite graphwith $m$ edges. We first prove that to determine the smallest cardinality of aset $S\subseteq V(G)$ such that $S$ covers at least $\rho m$ edges of $G$, isan NP-hard problem. Then we prove that for any constant $t$,$Sdyn_{t}(G)=P\beta_{nt-m}(G)$ and $Smon_t(G)=P\beta_{nt/2}(G)$, where $n$ and$m$ are the order and size of $G$, respectively.

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies