# Locating-Chromatic Number of Amalgamation of Stars

## DOI:

https://doi.org/10.5614/itbj.sci.2011.43.1.1## Abstract

Let G be a connected graph and c a proper coloring of G . For i 1,2,,k define the color class i C as the set of vertices receiving color i . The color code c (v) "? of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C d v C where ( , ) i d v C is the distance of v to i C . If all distinct vertices of G have distinct color codes, then c is called a locating-coloring of G . The locating-chromatic number of graph G , denoted by ( ) L G is the smallest k such that G has a locating coloring with k colors. In this paper we discuss the locating-chromatic number of amalgamation of stars k ,m S . k ,m S is obtained from k copies of star 1,m K by identifying a leaf from each star. We also determine a sufficient condition for a connected subgraph k ,m H "?~ S satisfying , ( ) ( ) L L k m H "?T .## References

Chartrand, G., Erwin, D., Henning, M.A., Slater, P.J. & Zang. P., The locating-chromatic number of a graph, Bull. Inst. Combin. Appl., 36, pp. 89-101, 2002.

Chartrand, G., Erwin, D., Henning, M.A., Slater & P.J., Zang. P., Graph of order n with locating-chromatic number n {1, Discrete Mathematics, 269, pp. 65-79, 2003.

Carlson, K., Generalized books and m C -snakes are prime graphs, Ars Combin., 80, pp. 215-221, 2006.