Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 2 1 2017 06 01 The locating-chromatic number for Halin graphs 1 9 13577 10.22049/cco.2017.13577 EN I.A. Purwasih Institut Teknologi Bandung Edy T. Baskoro Institut Teknologi Bandung H. Assiyatun Institut Teknologi Bandung D. Suprijanto Institut Teknologi Bandung M. Baca Technical University in Koˇsice Journal Article 2016 09 22 Let $G$ be a connected graph. Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots, R_k\}$ be an ordered partition of $V(G)$ into color classes. For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\Pi$ to be a $k$-tuple $(d(v,R_1),d(v,R_2),\ldots,d(v,R_k)),$ where $d(v,R_i)= \text{min}\{d(v,x)|x\in R_i\}.$ If distinct vertices have distinct color codes, then we call $f$ a {\em locating coloring} of $G.$ The {\em locating-chromatic number} of $G$ is the minimum number $k$ such that $G$ admits a locating coloring with $k$ colors. In this paper, we determine a lower bound of the locating-chromatic number of Halin graphs. We also give the locating-chromatic number of a Halin graph of a double star. https://comb-opt.azaruniv.ac.ir/article_13577_9dac2d0404e2e5ec398a745ba8ebe908.pdf