BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG

Authors

  • Des Welyyanti Jurusan Matematika, FMIPA, Universitas Andalas

DOI:

https://doi.org/10.24036/eksakta/vol19-iss1/130

Keywords:

Bilangan Kromatik-Lokasi, Graf Tak Terhubung, Kode Warna.

Abstract

The locating-chromatic number of a graph is introduced by Chartrand et al. in 2002. Firstly, Chatrand et al. determine the locating-chromatic number of path and double stars. The locating-chromatic number is an interesting concept ini graph theory. In this paper, we determine some condtions for  disconnected graphs has a finite locating-chromatic number.

Downloads

Download data is not yet available.

Downloads

Published

2018-04-25

Issue

Vol. 19 No. 1 (2018): Eksakta : Berkala Ilmiah Bidang MIPA (E-ISSN : 2549-7464)

Section

EKSAKTA: Berkala Ilmiah Bidang MIPA

License

This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted non-commercial use, distribution and reproduction in any medium

How to Cite

1.
BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG. EKSAKTA [Internet]. 2018 Apr. 25 [cited 2026 Jul. 24];19(1):76-82. Available from: https://eksakta.ppj.unp.ac.id/index.php/eksakta/article/view/130

Most read articles by the same author(s)