Abstract
The locating-chromatic number of a graph combined two graph concept, coloring vertices and partition dimension of a graph. The locating-chromatic number, denoted by χL(G), 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(4,2).
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.