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 $\mathcal{U}(n,k)$ and $\Gamma(n,k)$ be the set of the $k$-uniform linearand nonlinear unicyclic hypergraphs having perfect matchings with $n$ verticesrespectively, where $n\geq k(k-1)$ and $k\geq 3$. By using some techniques oftransformations and constructing the incidence matrices for the hypergraphsconsidered, we get the hypergraphs with the maximal spectral radii among threekinds of hypergraphs, namely $\mathcal{U}(n,k)$ with $n= 2k(k-1)$ and $n\geq9k(k-1)$, $\Gamma(n,k)$ with $n\geq k(k-1)$, and $\mathcal{U}(n,k)\cup\Gamma(n,k)$ with $n\geq 2k(k-1)$, where $k\geq 3$.

The maximal spectral radius of the uniform unicyclic hypergraph with perfect matchings