On Locating Chromatic Number of Disconnected Graph with Path, Cycle, Stars or Double Stars as its Components

Abstract

Concept of the locating-chromatic number of graphs is introduced firstly by Chartrand et al. in 2002. In this concept only limited for connected graphs. In 2004, Welyyanti et al. generalized the concept and notion of the locating-chromatic number of a graph such that it can be applied for a disconnected graph. In this paper, we determine the locating-chromatic number for disconnected graphs with path, stars, cycle, or double stars as it's components.