Author:
Irawan A,Asmiati ,Suharsono ,Muludi K
Abstract
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).
Subject
General Physics and Astronomy
Reference12 articles.
1. The locating-chromatic number of a graph;Chartrand;Bull. Inst. Combin. Appl.,2002
2. Graph of order n with locating-chromatic number n −1;Chartrand;Discrete Math,2003
3. On the locating chromatic number of kneser graphs;Behtoei;Discrete Applied Mathematics,2011
4. The locating-chromatic number for corona product of graphs Southeast-Asian;Baskoro;J. Of Sciences,2012
5. Locating chromatic number of banana tree;Asmiati;International Mathematical Forum,2017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献