Roman domination and Mycieleki's structure in graphs

Details Roman domination and Mycieleki's structure in graphs Roman domination and Mycieleki's structure in graphs

2011-05-17

arxiv.org/abs/1105.3290v1

Mathematics

Combinatorics

Scientific paper

For a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is called Roman dominating function (RDF) if for any vertex $v$ with $f(v)=0$, there is at least 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 RDF of $G$ is its Roman domination number and denoted by $\gamma_ R(G)$. In this paper, 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 then characterize the graphs achieving equality in these bounds. Then for any positive 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 discussed graphs.

Affiliated with

Also associated with

No associations

Rating

Roman domination and Mycieleki's structure in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Roman domination and Mycieleki's structure in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roman domination and Mycieleki's structure in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727675