Abstract
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 alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠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.
Citations
-
3
CrossRef
-
0
Web of Science
-
3
Scopus
Authors (3)
Cite as
Full text
download paper
downloaded 45 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1515/fcds-2015-0009
- License
- open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Foundations of Computing and Decision Sciences
no. 40,
pages 133 - 141,
ISSN: 0867-6356 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Jurkiewicz M., Kubale M., Ocetkiewicz K.: On the independence number of some strong products of cycle-powers// Foundations of Computing and Decision Sciences. -Vol. 40., nr. 2 (2015), s.133-141
- DOI:
- Digital Object Identifier (open in new tab) 10.1515/fcds-2015-0009
- Verified by:
- Gdańsk University of Technology
seen 183 times
Recommended for you
Product Graph Invariants with Applications in the Theory of Information
- M. Jurkiewicz,
- M. Kubale
2012