Hilda Assiyatun
The investigation on the locating chromatic number of a graph was initiated by Chartrand et al. in 2002. This concept is in fact a special case of the partition dimension of a graph. Let G = (V,E) be a connected graph. The locating-chromatic number of G, denoted by χL(G), is the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not contained in the same partition class. This topic has received much attention. However, the results are still limited. In particular, the locating-chromatic number of trees is not completely solved. In this research we will investigate the locating-chromatic number of trees embedded in 2-dimensional grid with maximum degree 4.
Penerapan Karya Tulis
The topic of locating-chromatic number of graph was first initiated by Chartrand et al. in 2002. They have determined the locating-chromatic numbers of some well known classes of graph, i.e. paths, cycles, and double stars. They also have characterized all graphs of order n with locating-chromatic number n, i.e. multipartite complete graphs.This topic has received much attention. Inspired by Chartrand, other authors have determined the locating chromatic numbers of some well known classes of graphs. But the results are still limited. In particular for trees, the locating-chromatic number of trees are still open.