Locating chromatic number of banana tree

Abstract

Locating chromatic number of a graph G, denoted by χ L (G) is a combination of two concepts, namely coloring and partition dimension of graph. On the locating chromatic number of G, every vertex is partitioned into color classes. The distance of every vertex to the color classes is considered to produce a different color code. In this paper will be discussed about the locating chromatic number of banana tree.

Further Results on Locating Chromatic Number for Amalgamation of Stars Linking by One Path

“…Chartrand et al [9][10] obtained the locating chromatic number of some classes of graphs such that: paths, stars, double stars, caterpillars, complete graphs, bipartite graphs, and the characterization of graphs having locating chromatic number n, (n − 1), or (n − 2). Next, Asmiati et al investigated locating chromatic number for special kind of trees, namely: amalgamation of stars [1], [4], firecracker graphs [2], banana trees [5]. Moreover, Baskoro at al.…”

The locating-chromatic number of subdivision firecracker graphs

“…Asmiati et al [3] obtained the locating chromatic number of amalgamation of stars and furhemore, Asmiati [4] found for non homogeneous amalgamation of stars. Next, Asmiati [5] investigated the locating chromatic number for banana tree.…”