On The Independence Number Of Some Strong Products Of Cycle-Powers
In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2015-06-01
|
| Series: | Foundations of Computing and Decision Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/fcds-2015-0009 |
| Summary: | In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish new exact values and/or lower bounds on the Shannon capacity of noisy channels. |
|---|---|
| ISSN: | 2300-3405 |