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

It is known that the problem of computing the edge dimension of a graph isNP-hard, and that the edge dimension of any generalized Petersen graph $P(n,k)$is at least 3. We prove that the graph $P(n,3)$ has edge dimension 4 for $n\ge11$, by showing semi-combinatorially the nonexistence of an edge resolving setof order 3 and by constructing explicitly an edge resolving set of order 4.

The edge metric dimension of the generalized Petersen graph $P(n,3)$ is 4