Bilangan Kromatik Lokasi Subdivisi Operasi Barbel Tertentu Graf Origami B_O_3^s, B_O_4^s, B_O_5^s, B_O_", journal = "FMIPA Universitas Lampung", volume = "Vol 2, No 2 (2021): Jurnal Siger Matematika", pages = "", year = "2021", url = https://jurnal.fmipa.unila.ac.id/JSM/article/view/2932/2020 author = "Agus Iriawan; Asmiati Asmiati; La Zakaria; Kurnia Muludi; Bernadhita Herindri Samodra Utami", abstract = "Let G=(V,E) be a connected graph and c be a proper k-coloring of G with color 1,2,...,k. Let C_1,C_2,...,C_k be a partition of V(G) which is induced by coloring c. The color code c_Phi(v) of v is the ordered k-tuple (d(v,C_1),d(v,C_2),...,d(v,C_k)) where d(v,C_i)= mind(v,x)|x C_i for any i. If all distinct vertices of G have distinct color codes, then c is called k-locating coloring of G. The locating-chromatic number, denoted by χ_L(G), is the smallest k such that G has a locating k-coloring. Subdivision certain barbell origami graphs, for s>=1, is a graph with V(B_O_n^s)={u_i,u_n+i,v_i,v_n+i,w_i,w_n+i|1in} U x_i|1<=i<=s and E(B_O_n^s)=u_iw_i,u_iv_i,v_iw_i,u_iu_i+1,w_iu_i+1|1in U u_n+iw_n+i,u_n+iv_n+i,v_n+iw_n+i,u_n+iu_n+i+1,w_n+iu_n+i+1|1in-1 U u_nx_1,x_nu_n+1 Ux_ix_i+1|1is-1. In this paper, we will determined the locating-chromatic number of subdivision certain barbell origami graphs B_O_3^s,B_O_4^s , B_O_5^s and B_O_6^s.",