Further hardness results on the rainbow vertex-connection number of graphs

Details Further hardness results on the rainbow vertex-connection number of graphs Further hardness results on the rainbow vertex-connection number of graphs

2011-10-10

arxiv.org/abs/1110.1915v1

Mathematics

Combinatorics

10 pages

Scientific paper

A vertex-colored graph $G$ is {\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\it rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow vertex-connected. In a previous paper we showed that it is NP-Complete to decide whether a given graph $G$ has $rvc(G)=2$. In this paper we show that for every integer $k\geq 2$, deciding whether $rvc(G)\leq k$ is NP-Hard. We also show that for any fixed integer $k\geq 2$, this problem belongs to NP-class, and so it becomes NP-Complete.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146345