EKSAKTA: Berkala Ilmiah Bidang MIPA
Open Access
BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG
1
Jurusan Matematika, FMIPA, Universitas Andalas
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.
ARTICLE INFORMATION
RECEIVED · REVISED · ACCEPTED
2018-03-31 ·
2018-04-07 ·
2018-04-07
PUBLISHED
2018-04-25
ISSUE
SECTION
EKSAKTA: Berkala Ilmiah Bidang MIPA
PAGES
76-82
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
Downloads
Download data is not yet available.
How to Cite
1.
BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG. EKSAKTA [Internet]. 2018 Apr. 25 [cited 2026 Sep. 4];19(1):76-82. Available from: https://eksakta.ppj.unp.ac.id/index.php/eksakta/article/view/130