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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The  conditional fractional strong matching preclusion number  of a graph  G  is the minimum size of  F  such thatand  G − F  has neither a fractional perfect matching nor an isolated vertex. In this paper, we obtain the conditional fractional strong matching preclusion number for burnt pancake graphs and a subset of the class of pancake-like graphs.

Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs