The locating-chromatic number for a subdivision of a wheel on one cycle edge (Q2443431)

Let \(G\) be a connected graph and \(c\) be a coloring of \(V(G)\) which induces a partition of \(V(G)\) into color classes \(R_1,\ldots ,R_k\). The color code of vertex \(v\) is the ordered \(k\)-tuple \((d(v,R_1),\ldots ,d(v,R_k))\), where \(d(v,R_i)=\min \{d(v,x) \mid x\in R_i\}\) for \(1\leq i\leq k\). The coloring \(c\) is said to be a locating \(k\)-coloring on \(G\) if the color codes of distinct vertices are distinct. The locating-chromatic number of \(G\), denoted by \(\chi _{L}(G)\), is the smallest \(k\) such that \(G\) possesses a locating \(k\)-coloring. Recently, \textit{A. Behtoei} [Discrete Appl. Math. (to appear)] deduced the locating-chromatic number of a wheel \(W_n=K_1+C_n\). Let \(H_2\) be a graph obtained by a subdivision of \(W_n\), \(n\geq 3\), on edge \(e\) into \(k\geq 1\) parts, where \(e\) is a cycle edge of \(W_n\). In this paper the following lower and upper bounds are deduced: \(\chi _{L}(W_n)-1\leq \chi _{L}(H_2)\leq \chi _{L}(W_n)\). Also, the authors prove that the lower bound is reached for \(n=4,6, (m^3-m^2)/2-1\), where \(m\geq 3\).