Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

Details Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

2011-03-17

arxiv.org/abs/1103.3369v1

Mathematics

Combinatorics

6 pages

Scientific paper

A vertex-colored graph $G$ is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection number of $G$, denoted by $rvc(G)$, is the minimum number of colors that are needed to make $G$ rainbow vertex-connected. In this paper we give a Nordhaus-Gaddum-type result of the rainbow vertex-connection number. We prove that when $G$ and $\bar{G}$ are both connected, then $2\leq rvc(G)+rvc(\bar{G})\leq n-1$. Examples are given to show that both the upper bound and the lower bound are best possible for all $n\geq 5$.

Affiliated with

Also associated with

No associations

Rating

Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph 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 Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247797