Asmiati, Asmiati and Irawan, Agus and Suharsono, Suharsono and Zakaria, L. and Junaidi, Akmal (2019) Further Results on Locating Chromatic Number of GeneralizedPetersen Graphs. In: International Congress of Mathematicians, 2018, 1  9 Agustus 2018, Barra da Tijuca Rio de Janeiro, Brasil. (Unpublished)

Text
Abstract%20Asmiati.pdf Download (103kB)  Preview 
Abstract
Let G be a connected graph and c a proper coloring of G. For i = 1; 2; : : : ; k define the color class Ci as the set of vertices receiving color i. The color code c�(v) of a vertex v in is the ordered ktuple (d(v;C1); : : : ; d(v;Ck)) where (d(v;C1) is the distance of v to Ci. If all distinct vertices of G have distinct color codes, then c is called a locatingcoloring of G . The locatingchromatic number of graph G, denoted by �L(G) is the smallest k such that G has a locating coloring with k colors. Let fu1; u2; : : : ; ung be some vertices on the outer cycle and fv1; v2; : : : ; vng be some vertices on the inner cycle, for n � 3. The Generalized Petersen graph, denoted by Pn;k, n � 3, 1 � k � bn
Item Type:  Conference or Workshop Item (Paper) 

Subjects:  Q Science > QA Mathematics > QA76 Computer software 
Divisions:  Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Magister Ilmu Matematika 
Depositing User:  Dr Suharsono S 
Date Deposited:  14 Nov 2019 11:05 
Last Modified:  14 Nov 2019 11:05 
URI:  http://repository.lppm.unila.ac.id/id/eprint/16249 
Actions (login required)
View Item 