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 $\mathbb{G}_{n,\gamma}$ be the set of simple and connected graphs on $n$vertices and with domination number $\gamma$. The graph with minimum spectralradius among $\mathbb{G}_{n,\gamma}$ is called the minimizer graph. In thispaper, we first prove that the minimizer graph of $\mathbb{G}_{n,\gamma}$ mustbe a tree. Moreover, for$\gamma\in\{1,2,3,\lceil\frac{n}{3}\rceil,\lfloor\frac{n}{2}\rfloor\}$, wecharacterize all minimizer graphs in $\mathbb{G}_{n,\gamma}$.

The minimum spectral radius of graphs with a given domination number