On Locating Chromatic Number of Disconnected Graph
Des Welyyanti, Mohammed El Azhari, R Lestari · Journal of Physics Conference Series · 2021
Abstract Let is H a disconnected graph and c is the locating k-coloring of H. The locating-chromatic number of H, denoted by XL ' (H), is the smallest k such that H admits a locating-coloring with k colors. In this paper, we study the locating-chromatic number of disconnected graph with path P 4 and double stars Sm,n graph as its components.