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

For a undirected simple graph $G$, let $d_i(G)$ be the number of $i$-elementdominating vertex set of $G$. The domination polynomial of the graph $G$ isdefined as $$D(G, x) = \sum_{i = 1}^n d_i(G)x^i.$$ Alikhani and Pengconjectured that $D(G, x)$ is unimodal for any graph $G$. Answering a proposalof Beaton and Brown, we show that $D(G, x)$ is unimodal when $G$ has at least$2^{13}$ vertices and has a universal vertex, which is a vertex adjacent to anyother vertex of $G$. We further determine possible locations of the mode.

Domination polynomial is unimodal for large graphs with a universal vertex