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 graph $G$ is $k$-path-coverable if its vertex set $V(G)$ can be covered by$k$ or fewer vertex disjoint paths. In this paper, using the $Q$-index of aconnected graph $G$, we present a tight sufficient condition for $G$ with fixedminimum degree and large order to be $k$-path-coverable.

A tight $Q$-index condition for a graph to be $k$-path-coverable involving minimum degree