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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $\gamma(G)$ and $i(G)$ be the domination number and the independentdomination number of $G$, respectively. In 1977, Hedetniemi and Mitchell beganwith the comparison of of $i(G)$ and $\gamma(G)$ and recently Rad and Volkmannposted a conjecture that $i(G)/ \gamma(G) \leq \Delta(G)/2$, where $\Delta(G)$is the maximum degree of $G$. In this work, we prove the conjecture for treesand provide the graph achieved the sharp bound.

The ratio of domination and independent domination numbers on trees