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

The forcing number of a perfect matching $M$ of a graph $G$ is the smallestcardinality of subsets of $M$ that are contained in no other perfect matchingsof $G$. The forcing spectrum of $G$ is the collection of forcing numbers of allperfect matchings of $G$. In this paper, we classify the perfect matchings of ageneralized Petersen graph $P(n,2)$ in two types, and show that the forcingspectrum is the union of two integer intervals. For $n\ge 34$, it is$\left[\lceil \frac { n }{ 12 } \rceil+1,\lceil \frac { n+3 }{ 7 } \rceil+\delta (n)\right]\cup \left[\lceil \frac { n+2 }{ 6 } \rceil,\lceil \frac { n}{ 4 } \rceil\right]$, where $\delta (n)=1$ if $n\equiv 3$ (mod 7), and $\delta(n)=0$ otherwise.

On the forcing spectrum of generalized Petersen graphs P(n,2)