Asmiati, Asmiati and Aristoteles, Aristoteles (2018) Classification of Generalized Petersen Graphs having Locating Chromatic Number Five. In: ICOMSET, 4-5 Oktober 2018, Padang. (Unpublished)

Preview	Text Abstract Asmiati.pdf Download (102kB) | Preview
Preview	Text Sertifikat Icomset.pdf Download (442kB) | Preview

Abstract

Let G be a connected graph and c be 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 k-tuple (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 locating-coloring of G . The locating-chromatic number of graph G, denoted by �L(G) is the smallest k such that G has a locating coloring with k colors. The generalized Petersen graph P(n;m), n � 3 and 1 � m � b(n

Item Type:	Conference or Workshop Item (Speech)
Subjects:	Q Science > QA Mathematics
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User:	ASMIATI
Date Deposited:	15 Nov 2018 08:09
Last Modified:	15 Nov 2018 08:09
URI:	http://repository.lppm.unila.ac.id/id/eprint/9995

Actions (login required)

View Item