Improved Bounds for Radio k-Chromatic Number of Hypercube Qn
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 avoided as reported by Hale...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Wiley
2011-01-01
|
| Schriftenreihe: | International Journal of Mathematics and Mathematical Sciences |
| Online-Zugang: | http://dx.doi.org/10.1155/2011/961649 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|