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.
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
