Asmiati, Asmiati (2017) Graf Petersen Berbilangan Kromatik Lokasi Empat. In: Semirata BKS-PTN Wilayah Barat Bidang MIPA, 22-24 Mei 2017, Universitas Sriwijaya.

Graf Petersen.pdf

Download (344kB) | Preview
Official URL:


Let be a finite, simple, and connected graph. Let be a proper coloring of a connected graph using the colors for some positive integer , where for adjacent vertices and in . Thus, the coloring can be considered as a partition of into color classes (independent sets) , where the vertices of are colored by for . The color code of a vertex in is the ordered -tuple where for . If all distinct vertices of have distinct color codes, then is called a locating-coloring of . A minimum locatingcoloring uses a minimum number of colors and this number is called the locating-chromatic number of graph , denoted by . In this paper will be discussed about the locating-chromatic number of Petersen Graph.

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: 30 Aug 2017 03:23
Last Modified: 30 Aug 2017 03:23

Actions (login required)

View Item View Item