|
|
|
Agus Irawan, Asmiati Asmiati, La Zakaria and Kurnia Muludi
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by ????(??)
?
L
(
G
)
. This...
ver más
|
|
|