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 domination polynomial of a graph $G$ of order $n$ is the polynomial$D(G,x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number ofdominating sets of $G$ of size $i$, and $\gamma(G)$ is the domination number of$G$. The roots of domination polynomial is called domination roots. In thisarticle, we compute the domination polynomial and domination roots of allgraphs of order less than or equal to 6, and show them in the tables.

An atlas of domination polynomials of graphs of order at most six