Abstract
The locating-chromatic number of a graph is combined two graph concept, coloring vertices and partition dimension of a graph. The locating-chromatic number, denoted by XLG, is the smallest k such that G has a locating k-coloring. In this paper, we discuss the locating- chromatic number for certain operation of generalized Petersen graphs sP(n,1).
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
