期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2011
卷号：2011
DOI：10.1155/2011/961649
出版社：Hindawi Publishing Corporation
摘要：A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (nonnegative integers) to the stations in an optimal way such that
interference is avoidedas reported by Hale (2005). Radio 𝑘-coloring of a graph is a special type of channel assignment problem. Kchikech et al. (2005) have given a lower and an upper bound for radio 𝑘-chromatic number of hypercube 𝑄𝑛, and an improvement of their lower bound was obtained by Kola and Panigrahi (2010). In this paper, we further improve Kola et al.'s lower bound as well as Kchikeck et al.'s upper bound. Also, our bounds agree for nearly antipodal number of 𝑄𝑛 when 𝑛≡2 (mod 4).
