Abstract
Let is H a disconnected graph and c is the locating k-coloring of H. The locating-chromatic number of H, denoted by XL ' (H), is the smallest k such that H admits a locating-coloring with k colors. In this paper, we study the locating-chromatic number of disconnected graph with path P 4 and double stars Sm,n graph as its components.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
