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

Recently, we initiated the study of random walk labelings of graphs. Theseare graph labelings that are obtainable by performing a random walk on thegraph, such that each vertex is labeled upon its first visit. In this work, wecalculate the number of random walk labelings of several natural graphfamilies: The wheel, fan, barbell, lollipop, tadpole, friendship, and snakegraphs. Additionally, we prove several combinatorial identities that emergedduring the calculations.

Further Results on Random Walk Labelings