BILANGAN KROMATIK LOKASI UNTUK GRAF AMALGAMASI BINTANG
Abstract: Let G = (V,E) be a
connected graph and c a coloring of G. For i = 1, 2, ..., k, we define the
color classes Ci as the set of vertices receiving color i. The color code cII(ðœ) of a vertex ðœ ϵ V (G) is the k-vector (d(ðœ,C1), d(ðœ,C2), ..., d(ðœ,Ck)), where d(ðœ,Ci) is the
distance between ðœ and Ci. If all vertices of G have distinct color codes,
then c is called a locating-coloring of G. The locating-coloring number of
graph G, denoted by ðŸ€L(G), is the
smallest positive integer k such that G has a locating coloring with k color.
Let K1,ni be star, where ni is the number of leaves of each star K1,ni . We define
the vertex amalgamation of star, denoted by Sk,(n1,...,nk), as a graph obtained
from stars K1,ni by identifying one arbitrary leaf from each star. We define
the edge amalgamation of star, denoted by S*k,(n1,...,nk), as a graph obtained by uniting an edge of each
star. If ni = m for each i, then we denoted the vertex amalgamation of star as
Sk,m and the edge amalgamation of star as S*k,m. In this paper we discuss the locating coloring of Sk,(n1,...,nk) and S*k,(n1,...,nk)
Penulis: FADHILAH SYAMSI
Kode Jurnal: jpmatematikadd130112
