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 $D$ be a digraph. We define the minimum semi-degree of $D$ as$\delta^{0}(D) := \min \{\delta^{+}(D), \delta^{-}(D)\}$. Let $k$ be a positiveinteger, and let $S = \{s\}$ and $T = \{t_{1}, \dots ,t_{k}\}$ be any twodisjoint subsets of $V(D)$. A set of $k$ internally disjoint paths joiningsource set $S$ and sink set $T$ that cover all vertices $D$ are called aone-to-many $k$-disjoint directed path cover ($k$-DDPC for short) of $D$. Adigraph $D$ is semicomplete if for every pair $x,y$ of vertices of it, there isat least one arc between $x$ and $y$.  In this paper, we prove that every semicomplete digraph $D$ of sufficientlylarge order $n$ with $\delta^{0}(D) \geq \lceil (n+k-1)/2\rceil$ has aone-to-many $k$-DDPC joining any disjoint source set $S$ and sink set $T$,where $S = \{s\}, T = \{t_{1}, \dots, t_{k}\}$.

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs