For a nontrivial connected graph G,let c：V（G）→N be a vertex coloring of G where adjacent vertexes may be colored the same.For a vertex ν of G,the neighborhood color set NC（ν） is the set of colors of the neighbors of ν.The coloring c is called a set colori