Bounds on the 2-rainbow domination number of graphs

Details Bounds on the 2-rainbow domination number of graphs Bounds on the 2-rainbow domination number of graphs

2010-05-06

arxiv.org/abs/1005.0988v1

Mathematics

Combinatorics

Scientific paper

A {\it 2-rainbow domination function} of a graph $G$ is a function $f$ that assigns to each vertex a set of colors chosen from the set $\{1,2\}$, such that for any $v\in V(G)$, $f(v)=\emptyset$ implies $\bigcup_{u\in N(v)}f(u)=\{1,2\}$. The {\it 2-rainbow domination number $\gamma_{r2}(G)$} of a graph $G$ is the minimum $w(f)=\Sigma_{v\in V}|f(v)|$ over all such functions $f$. Let $G$ be a connected graph of order $|V(G)|=n\geq 3$. We prove that $\gamma_{r2}(G)\leq 3n/4$ and we characterize the graphs achieving equality. We also prove a lower bound for 2-rainbow domination number of a tree using its domination number. Some other lower and upper bounds of $\gamma_{r2}(G)$ in terms of diameter are also given.

Affiliated with

Also associated with

No associations

Rating

Bounds on the 2-rainbow domination number of 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 Bounds on the 2-rainbow domination number of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the 2-rainbow domination number of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26383