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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
