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

A Random walk labeling of a graph $G$ is any labeling of $G$ that could havebeen obtained by performing a random walk on $G$. Continuing two recent works,we calculate the number of random walk labelings of perfect trees, combs, anddouble combs, the torus $C_2\times C_n$, and the graph obtained by connectingthree path graphs to form two cycles.

Random Walk Labelings of Perfect Trees and Other Graphs