Abstract
In this paper we discuss the locating chromatic number of a disconnected graph, namely a disjoint union of some double stars. To determine the locating-chromatic number of a graph, first we construct the upper bound of the number and observe the minimum coloring used. Then, to determine the lower bound of the number, we use the trivial lower bound for some leaves which incident to one vertex. Two main theorems about the locating chromatic number of a disjoint union of some double stars. We obtained some original results of the locating chromatic number of disjoint union of some double stars. Moreover, we can generalize the graph such that the locating chromatic number remains the same with the previous one.
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.
