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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

A distance between two vertices of a connected graph is the shortest distance between them. The metric dimension of a connected graph G is the minimum cardinality of a subset W of vertices of G such that all vertices are uniquely determined by their distances from W. A family \(\mathcal {G}\) of connected graphs is a family with constant metric dimension if dim(G) is finite and does not depend upon the choice of G in \(\mathcal {G}\). In this paper we study the metric dimension of two classes of convex polytopes and show that these classes of convex polytopes have constant metric dimension.

On the metric dimension of two families of convex polytopes