Abstract
A married of vertex coloring partition and dimension of graph, became a definition of locating chromatic number of graph. That draught only can apply for connected graph. Because that, Welyyanti et al. expand concept of the locating chromatic number for disconnected graph. For this paper, the locating-chromatic number of disconnected graph contains one path and wheel graph as its components, is determined.
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.
