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 concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing. It is hard to compute exact values of partition dimension for a graphic metric space, ( G ,  d   G  ) and networks. In this article, we give the sharp upper bounds and lower bounds for the partition dimension of generalized Möbius ladders,  M   m ,  n  , for all  n ≥3 and  m ≥2.

Sharp bounds for partition dimension of generalized Möbius ladders