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/

Zendy Plus

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

Zendy Tools

Zendy Open

We show that if G is a 3-vertex-connected C4-free graph of order n and radius r, then the inequality r≤2n/9+O1 holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.

An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph