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

Let $G$ be a connected graph and $d(a,b)$ be the distance between thevertices $a$ and $b$. A subset $U =\{u_1,u_2,\cdots,u_k\}$ of the vertices iscalled a resolving set for $G$ if for every two distinct vertices $a,b \inV(G)$, there is a vertex $u_\xi \in U$ such that $d(a,u_\xi)\neq d(b,u_\xi)$. Aresolving set containing a minimum number of vertices is called a metric basisfor $G$ and the number of vertices in a metric basis is its metric dimensiondenoted by $dim(G)$. A resolving set $U$ for $G$ is fault-tolerant if $U\setminus \{u\}$ is also a resolving set, for each $u \in U$, and thefault-tolerant metric dimension of $G$ is the minimum cardinality of such aset. In this paper we introduce the study of the fault-tolerant metricdimension of $P(n,2)$ with prism graph.

Fault-Tolerant Metric Dimension of $P(n,2)$ with Prism Graph