Let G = (V,E) be a connected graph. Let c be a proper coloring using k colors, namely 1, 2,·s, k. Let <span style="font-family: symbol;">P</span>={S<sub>1</sub>, S<sub>2</sub>,..., S<sub>k</sub>} be a partition of V(G) induced by c and let S<sub>i</sub> be the color class that receives the color i. The color code, c<sub><span style="font-family: symbol;">P</span></sub>(v)=(d(v,S<sub>1</sub>), d(v,S<sub>2</sub>),...,d(v,S<sub>k</sub>)), where d(v,S<sub>i</sub>)=min {d(v,x)|x <span style="font-family: symbol;">Î</span> S<sub>i</sub>} for i <span style="font-family: symbol;">Î</span> [1,k]. If all vertices in V(G) have different color codes, then c is called as the \emphlocating-chromatic k-coloring of G. Minimum k such that G has the locating-chromatic k-coloring is called the locating-chromatic number, denoted by <span style="font-family: symbol;">c</span><sub>L</sub>(G). In this paper, we discuss the locating-chromatic number for n certain amalgamation of stars linking a path, denoted by nS<sub>k,m</sub>, for n ≥ 1, m ≥ 2, k ≥ 3, and k>m.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.