Title of article
Radio k-Labelings for Cartesian Products of Graphs
Author/Authors
Kchikech، نويسنده , , Mustapha and Khennoufa، نويسنده , , Riadh and Togni، نويسنده , , Olivier، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
6
From page
347
To page
352
Abstract
Motivated by problems in radio channel assignment, we consider the radio k-labeling of cartesian product of two graphs. The objective is to minimize the span of the radio k-labeling. We provide upper and lower bounds for the k-chromatic number of the cartesian product of two graphs. This result helps to determine upper bounds for k-chromatic numbers of the square mesh and of the hypercube.
Keywords
Graph labeling , graph theory , radio channel assignment , radio k-labeling
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454177
Link To Document