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).
CITATION STYLE
Irawan, A., Asmiati, Suharsono, & Muludi, K. (2019). The Locating-Chromatic Number for Certain Operation of Generalized Petersen Graphs sP(4,2). In Journal of Physics: Conference Series (Vol. 1338). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1338/1/012033
Mendeley helps you to discover research relevant for your work.