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

For a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is called Romandominating function (RDF) if for any vertex $v$ with $f(v)=0$, there is atleast one vertex $w$ in its neighborhood with $f(w)=2$. The weight of an RDF$f$ of $G$ is the value $f(V)=\sum_{v\in V}f(v)$. The minimum weight of an RDFof $G$ is its Roman domination number and denoted by $\gamma_ R(G)$. In thispaper, we first show that $\gamma_{R}(G)+1\leq \gamma_{R}(\mu (G))\leq\gamma_{R}(G)+2$, where $\mu (G)$ is the Mycielekian graph of $G$, and thencharacterize the graphs achieving equality in these bounds. Then for anypositive integer $m$, we compute the Roman domination number of the$m$-Mycieleskian $\mu_{m}(G)$ of a special Roman graph $G$ in terms on$\gamma_R(G)$. Finally we present several graphs to illustrate the discussedgraphs.

Roman domination and Mycieleki's structure in graphs