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

A global defensive alliance in a graph $G=(V,E)$ is a dominating set $S$ satisfying the condition that for every vertex $v\in S$, $|N[v]\cap S|\geq |N(v)\cap(V-S)|$. In this note, a new upper bound on the global defensive alliance number of a tree is given in terms of its order and the number of support vertices. Moreover, we characterize trees attaining this upper bound.

A New Upper Bound on the Global Defensive Alliance Number in Trees