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 Plus

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

Zendy Tools

Zendy Open

Let $G$ be a graph and let $S(G)$, $M(G)$, and $T(G)$ be the subdivision, themiddle, and the total graph of $G$, respectively. Let ${\rm dim}(G)$, ${\rmedim}(G)$, and ${\rm mdim}(G)$ be the metric dimension, the edge metricdimension, and the mixed metric dimension of $G$, respectively. In this paper,for the subdivision graph it is proved that $\frac{1}{2}\max\{{\rm dim}(G),{\rmedim}(G)\}\leq{\rm mdim}(S(G))\leq{\rm mdim}(G)$. A family of graphs $G_n$ isconstructed for which ${\rm mdim}(G_n)-{\rm mdim}(S(G_n))\ge 2$ holds and thisshows that the inequality ${\rm mdim}(S(G))\leq{\rm mdim}(G)$ can be strict,while for a cactus graph $G$, ${\rm mdim}(S(G))={\rm mdim}(G)$. For the middlegraph it is proved that ${\rm dim}(M(G))\leq{\rm mdim}(G)$ holds, and if $G$ istree with $n_1(G)$ leaves, then ${\rm dim}(M(G))={\rm mdim}(G)=n_1(G)$.Moreover, for the total graph it is proved that ${\rm mdim}(T(G))=2n_1(G)$ and${\rm dim}(G)\leq{\rm dim}(T(G))\leq n_1(G)$ hold when $G$ is a tree.

On mixed metric dimension in subdivision, middle, and total graphs