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

This paper discusses a distance guarding concept on triangulation graphs,which can be associated with distance domination and distance vertex cover. Weshow how these subjects are interconnected and provide tight bounds for anyn-vertex maximal outerplanar graph: the 2d-guarding number, g_{2d}(n) = n/5;the 2d-distance domination number, gamma_{2d}(n) = n/5; and the 2d-distancevertex cover number, beta_{2d}(n) = n/4.

Distance domination, guarding and vertex cover for maximal outerplanar graph