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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $D$ be a strongly connected oriented graph with vertex-set $V$ andarc-set $A$. The distance from a vertex $u$ to another vertex $v$, $d(u,v)$ isthe minimum length of oriented paths from $u$ to $v$. Suppose$B=\{b_1,b_2,b_3,...b_k\}$ is a nonempty ordered subset of $V$. Therepresentation of a vertex $v$ with respect to $B$, $r(v|B)$, is defined as avector $(d(v,b_1), d(v,b_2), ..., d(v,b_k))$. If any two distinct vertices$u,v$ satisfy $r(u|B)\neq r(v|B)$, then $B$ is said to be a resolving set of$D$. If the cardinality of $B$ is minimum then $B$ is said to be a basis of $D$and the cardinality of $B$ is called the directed metric dimension of $D$.  Let $G$ be the underlying graph of $D$ admitting a $C_n$-covering. A$C_n$-simple orientation is an orientation on $G$ such that every $C_n$ in $D$is strongly connected. This paper deals with metric dimensions of orientedwheels, oriented fans, and amalgamation of oriented cycles, all of whichadmitting $C_n$-simple orientations.

Directed Metric Dimension of Oriented Graphs with Cyclic Covering