Open AccessBEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG
Author(s) -
Des Welyyanti
Publication year - 2018
Publication title -
eksakta
Language(s) - English
Resource type - Journals
eISSN - 2549-7464
pISSN - 1411-3724
DOI - 10.24036/eksakta/vol19-iss1/130
Subject(s) - chromatic scale , combinatorics , graph , physics , stars , mathematics , astrophysics
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.