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 walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly tollwalk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and$u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set$S \subseteq V(G)$, denoted by $I(S)$, is formed by $S$ and the verticesbelonging to some weakly toll walk between two vertices of $S$. Set $S$ is {\itweakly toll convex} if $I(S) = S$. The {\em weakly toll convex hull} of $S$,denote by $H(S)$, is the minimum weakly toll convex set containing $S$. The{\em weakly toll interval number} of $G$ is the minimum cardinality of a set $S\subseteq V(G)$ such that $I(S) = V(G)$; and the {\em weakly toll hull number}of $G$ is the minimum cardinality of a set $S \subseteq V(G)$ such that $H(S) =V(G)$. In this work, we show how to compute the weakly toll interval and theweakly toll hull numbers of a graph in polynomial time. In contrast, we showthat determining the weakly toll convexity number of a graph $G$ (the size of amaximum weakly toll convex set distinct from $V(G)$) is \NP-hard.

Computing the hull and interval numbers in the weakly toll convexity