On the locating chromatic number of Kneser graphs Original Research Article

Let image be a proper image-coloring of a connected graph image and image be an ordered partition of image into the resulting color classes. For a vertex image of image, the color code of image with respect to image is defined to be the ordered image-tuple image, where image. If distinct vertices have distinct color codes, then image is called a locating coloring. The minimum number of colors needed in a locating coloring of image is the locating chromatic number of image, denoted by image. In this paper, we study the locating chromatic number of Kneser graphs. First, among some other results, we show that image for all image. Then, we prove that image, when image. Moreover, we present some bounds for the locating chromatic number of odd graphs.