A Mathematical Model for the Rainbow Vertex-Connection Number

The concept of rainbow connection was introduced by Chartrand et al. [2] in 2008. A vertex-colored graph is rainbow vertexconnected if any two vertices are connected by a path whoseinternal vertices have distinct colors. The rainbow vertexconnection of a connected graph G, denoted by rvc(G), is theminimum number of colors needed to make G rainbow vertexconnected. In this paper, we introduce the first mathematical model of the problem

کلیدواژه ها:

Rainbow Vertex Connection ، Graph Coloring ، Integer Programming ، Mathematical Modeling