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 set of vertices $S\subseteq V(G)$ is a basis or resolving set of a graph$G$ if for each $x,y\in V(G)$ there is a vertex $u\in S$ such that $d(x,u)\neqd(y,u)$. A basis $S$ is a fault-tolerant basis if $S\setminus \{x\}$ is a basisfor every $x \in S$. The fault-tolerant metric dimension (FTMD) $\beta'(G)$ of$G$ is the minimum cardinality of a fault-tolerant basis. It is shown that eachtwin vertex of $G$ belongs to every fault-tolerant basis of $G$. As aconsequence, $\beta'(G) = n(G)$ iff each vertex of $G$ is a twin vertex, whichcorrects a wrong characterization of graphs $G$ with $\beta'(G) = n(G)$ from[Mathematics 7(1) (2019) 78]. This FTMD problem is reinvestigated for Butterflynetworks, Benes networks, and silicate networks. This extends partial resultsfrom [IEEE Access 8 (2020) 145435--145445], and at the same time, disprovesrelated conjectures from the same paper.

Twin Vertices in Fault-Tolerant Metric Sets and Fault-Tolerant Metric Dimension of Multistage Interconnection Networks