On The Independence Number Of Some Strong Products Of Cycle-Powers
References
- [1] B, C., P, A.,T, A. On the theta number of powers of cycle graphs., 3 (2013), 297–317.
- [2] B, S. H.,M, S. E. On the independence number of the strong product of cycle-powers., 1 (2013), 105–110.
- [3] B, L. D., ME, R. J., R, E., R, J., H. C., S, R.,T, H. A combinatorial packing problem. In. Amer. Math. Soc., Providence, R.I., 1971, pp. 97–108. SIAM–AMS Proc., Vol. IV.
- [4] B, T., H, R.,N, V. On the independence numbers of the cubes of odd cycles., 3 (2013), Paper 10, 19.
- [5] C, B., G, I.,R, G. Some remarks on the Shannon capacity of odd cycles.(2003), 243–257.
- [6] H, R. S. Numerical invariants and the strong product of graphs.(1973), 146–155.
- [7] K, J.,O, A. Zero-error information theory., 6 (1998), 2207–2229. Information theory: 1948–1998.
- [8] L, L. On the Shannon capacity of a graph., 1 (1979), 1–7.
- [9] S, C. E. The zero error capacity of a noisy channel., September (1956), 8–19.
- [10] V, A.,Ž, J. Improved lower bound on the Shannon capacity of C., 5 (2002), 277–282.
DOI: https://doi.org/10.1515/fcds-2015-0009 | Journal eISSN: 2300-3405 (formerly 0867-6356) | Journal ISSN: 0867-6356
Language: English
Page range: 133 - 141
Submitted on: Oct 6, 2014
Accepted on: Feb 11, 2015
Published on: May 16, 2015
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Related subjects:
© 2015 Marcin Jurkiewicz, Marek Kubale, Krzysztof Ocetkiewicz, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.