The Locating Chromatic Number for Split Graph of Cycle

Abstract

The minimum number of colors in a locating coloring of G is called the locating chromatic number of graph G, denoted by χL (G). Split graph of cycle with a set of vertices υ 1, υ 2, υ 3,.., υ n} is graph obtained by adding on vertex υi as many new k vertices so that each vertices neighbouring with each vertex that is neighbouring to vertex vi in the cycle graph. Split graph of cycle, denoted by spl(Cn) In this paper will be discussed about the locating chromatic number for split graph of cycle.