Des Welyyanti, Ibrahim Taufiqurrahman, Dony Permana, Rifda Sasmi Zahra, Lyra Yulianti
The locating chromatic number was introduced by Chartrand in 2002. Let G = (V, E) be a connected graph and let c be a coloring of G. If distinct vertices in G have distinct color codes, then c is called the locating coloring of G. The locating chromatic number of a graph, denoted as χL(G), is the minimum number of colors in a locating coloring of G. There have been several studies about the locating chromatic number of certain graphs. In this paper, we discuss the locating chromatic number of palm graph CkPlSm with k ≥ 3, l ≥ 2, m ≥ 2. © (2024), (International Association of Engineers). All rights reserved.
Department of Mathematics and Data Sciences, Faculty of Mathema-tics and Natural Sciences, Universitas Andalas, Kampus UNAND, Limau Manis Padang, Padang, 25163, Indonesia; Department of Mathematics and Data Sciences, Faculty of Mathematics and Natural Sciences, Universitas Andalas, Kampus UNAND, Limau Manis Padang, Padang, 25163, Indonesia; Department of Statistics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Padang, Padang, Indonesia
