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 matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. Let F be an edge subset and F′ be a subset of edges and vertices of a graph G. If G − F and G − F′ have no fractional matching preclusion, then F is a fractional matching preclusion (FMP) set, and F ′is a fractional strong matching preclusion (FSMP) set of G. The FMP (FSMP) number of G is the minimum number of FMP (FSMP) set of G. In this paper, we study fractional matching preclusion number and fractional strong matching preclusion number of split-star networks. Moreover, We categorize all the optimal fractional strong matching preclusion sets of split-star networks.

Fractional Strong Matching Preclusion of Split-Star Networks