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).
Sign-in/Register to access full text options 
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.
