BILANGAN KROMATIK LOKASI UNTUK JOIN DARI DUA GRAF
Abstract: Let ƒ be a proper
k-coloring of a connected graph G and II = (V1, ..., Vk) be an ordered
partition of V (G) into the resulting color classes. For a vertex ðœ of G, the color code of ðœ with respect to II is defined to be
the ordered k-tuple cII(ðœ) = (d(ðœ,
V1), d(ðœ, V2), ..., d(ðœ, Vk)), where d(ðœ, Vi) =
min{d(ðœ, x)|x ϵ Vi}, 1 ≤ i ≤ k. If distinct vertices have
distinct color codes, then ƒ is called a locating coloring. The minimum number
of colors needed in a locating coloring of G is the locating chromatic number
of G, and denoted by ðŸ€L(G). In this paper, we study the
locating chromatic number of the join of some graphs.
Penulis: YULI ERITA
Kode Jurnal: jpmatematikadd130115
