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

The paper presents some bipartite graph $L_{k,n}$, so called $(k,n)$-levelgraph, that arise by taking $k$-th and $(n-k)$-th levels of $n$-dimensionalBoolean algebra. Two results are establised: (1) precise description of adistance (a shotest path) beteen arbitrary vertices and (2) solution of theproblem how many vertices may be reached in $i$ steps starting from some intialpoint.

On the distance in some bipartite graphs $L_{k,n}$