Main Article Content

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.

Keywords

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

Article Details

How to Cite
1.
Welyyanti D. BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG. Eksakta [Internet]. 2018Apr.25 [cited 2020Aug.4];19(1):76-82. Available from: http://eksakta.ppj.unp.ac.id/index.php/eksakta/article/view/130