Bilangan Kromatik Lokasi Amalgamasi Sisi Graf Lingkaran $amal_s(C_n^j;v_{j,1}v_{j,n})$ dengan $n=3,4$, dan $m\geq2$

Welyyanti, Des
Daramenra, Romie
Yulianti, Lyra

Limits: Journal of Mathematics and Its Applications
Vol. 22 No. 3 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 3 Edisi No

Let G be a connected graph and {S_1,S_2,…,S_k} be an ordered partition of V(G). Let S_i is a set of color classes using colors 1,2,...,k where k as positive integer. The color code c_ (v) of vertex v in G with respect to  is defined as k-vector, c_ (v)=(d(v,S_1 ),d(v,S_2 ),…,d(v,S_i )) where d(v,S_i ). If each of vertices in G have distinct color codes, then c is called as locating coloring of G. The minimum number of colors that are used for locating coloring is called as locating chromatic number of G, denoted by X_L (G).