Improved Bounds for Radio k-Chromatic Number of Hypercube Qn

Abstract

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 k-coloring of a graph is a special type of… (More)
DOI: 10.1155/2011/961649

1 Figure or Table

Topics

  • Presentations referencing similar topics