Baskoro, Edy Tri and Asmiati, Asmiati (2013) Characterizing all trees with locatingchromatic number 3. Electronic Journal of Graph Theory and Applications, 1 (2). pp. 109117. ISSN 23382287

Text
Characterizing all trees with locatingchromatic 3.pdf Download (420kB)  Preview 
Abstract
Let c be a proper kcoloring of a connected graph G. Let � = fS1; S2; : : : ; Skg be the induced partition of V (G) by c, where Si is the partition class having all vertices with color i. The color code c�(v) of vertex v is the ordered ktuple (d(v; S1); d(v; S2); : : : ; d(v; Sk)), where d(v; Si) = minfd(v; x)jx 2 Sig, for 1 � i � k. If all vertices of G have distinct color codes, then c is called a locatingcoloring of G. The locatingchromatic number of G, denoted by �L(G), is the smallest k such that G posses a locating kcoloring. Clearly, any graph of order n � 2 has locatingchromatic number k, where 2 � k � n. Characterizing all graphs with a certain locatingchromatic number is a difficult problem. Up to now, all graphs of order n with locating chromatic number 2; n
Item Type:  Article 

Subjects:  Q Science > QA Mathematics 
Divisions:  Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika 
Depositing User:  ASMIATI 
Date Deposited:  15 Sep 2017 01:19 
Last Modified:  15 Sep 2017 01:19 
URI:  http://repository.lppm.unila.ac.id/id/eprint/3904 
Actions (login required)
View Item 