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 simple graph and let $n,m$ be two integers with $0<m<n$. Weprove that $iso(G-S)\leq \frac{n}{m}|S|$ for every $S \subset V(G)$ if and onlyif $G$ has a $\{C_{2i+1},T \colon 1 \leq i < \frac{m}{n-m},T\in\mathcal{T}_{\frac{n}{m}}\}$-factor, where $iso(G-S)$ denotes the number ofisolated vertices of $G-S$ and $\mathcal{T}_{\frac{n}{m}}$ is a special familyof trees. Furthermore, we characterize the trees in $\mathcal{T}_{\frac{n}{m}}$in terms of their bipartition.

Fractional factors and component factors in graphs with isolated toughness smaller than 1