Latifa Azhar Abel, Des Welyyanti, Lyra Yulianti, Dony Permana
The locating chromatic number of graph G (χL (G)) combines the idea of the partition dimension and the chromatic number by considering the locations of the vertices of graph G. Let (Cni, m) be a cyclic chain graph, namely a group of blocks in the form of a cycle graph (Formula Presented). The ni is the number of vertices on the i-th cycle, and m is the number of cycles, for ni ≥ 3,1 ≤ i ≤ m, and m ≥ 2, and the vertex (Formula Presented) is identified with the vertex (Formula Presented). In this research, we determine (Formula Presented). © 2025 The Authors.
Department of Mathematics and Data Science, Universitas Andalas, Kampus UNAND Limau Manis, Padang, 25163, Indonesia; Department of Statistics, Universitas Negeri Padang, Air Tawar, Padang, 25131, Indonesia
