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 Stacked-book graph Gm,n is obtained from the Cartesian product of a stargraph Sm and a path Pn, where m and s are the orders of the star graph and thepath respectively. Obtaining the radio number of a graph is a rigorous process,which is dependent on the diameter of G and positive difference of non-negativeinteger labels f(u) and f(v) assigned to any two u, v in the vertex set V (G)of G. This paper obtains tight upper and lower bounds of the radio number ofGm,n where the path Pn has an odd order. The case where Pn has an even orderhas been investigated.

Bounds of the Radio Number of Stacked-Book Graphs with Odd Paths