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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We prove that a strongly connected balanced bipartite digraph $D$ of order$2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$with a common in-neighbour or a common out-neighbour, is either bipancyclic ora directed cycle of length $2a$.

A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs