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...
সংরক্ষণ করুন:
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Wiley
2011-01-01
|
| মালা: | International Journal of Mathematics and Mathematical Sciences |
| অনলাইন ব্যবহার করুন: | http://dx.doi.org/10.1155/2011/961649 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|