On the locating-chromatic number for graphs with two homogenous components
Des Welyyanti, Edy Tri Baskoro, Rinovia Simajuntak, Saladin Uttunggadewa · Journal of Physics Conference Series · 2017
The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. The concept of the locating-chromatic number is a marriage between graph coloring and the notion of graph partition dimension. This concept is only for connected graphs. In [8], we extended this concept also for disconnected graphs. In this paper, we determine the locating- chromatic number of a graph with two components. In particular, we determine such values if the components are homogeneous and each component has locating-chromatic number 3.