On The Independence Number Of Some Strong Products Of Cycle-Powers

[1] Bachoc, C., Pêcher, A., and Thiéry, A. On the theta number of powers of cycle graphs. Combinatorica 33, 3 (2013), 297–317.Search in Google Scholar

[2] Badalyan, S. H., and Markosyan, S. E. On the independence number of the strong product of cycle-powers. Discrete Math. 313, 1 (2013), 105–110.Search in Google Scholar

[3] Baumert, L. D., McEliece, R. J., Rodemich, E., Rumsey, Jr., H. C., Stanley, R., and Taylor, H. A combinatorial packing problem. In Computers in algebra and number theory (Proc. SIAM-AMS Sympos. Appl. Math., New York, 1970). Amer. Math. Soc., Providence, R.I., 1971, pp. 97–108. SIAM–AMS Proc., Vol. IV.Search in Google Scholar

[4] Bohman, T., Holzman, R., and Natarajan, V. On the independence numbers of the cubes of odd cycles. Electron. J. Combin. 20, 3 (2013), Paper 10, 19.10.37236/2598Search in Google Scholar

[5] Codenotti, B., Gerace, I., and Resta, G. Some remarks on the Shannon capacity of odd cycles. Ars Combin. 66 (2003), 243–257.Search in Google Scholar

[6] Hales, R. S. Numerical invariants and the strong product of graphs. J. Combinatorial Theory Ser. B 15 (1973), 146–155.10.1016/0095-8956(73)90014-2Search in Google Scholar

[7] Körner, J., and Orlitsky, A. Zero-error information theory. IEEE Trans. Inform. Theory 44, 6 (1998), 2207–2229. Information theory: 1948–1998.10.1109/18.720537Search in Google Scholar

[8] Lovász, L. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25, 1 (1979), 1–7.Search in Google Scholar

[9] Shannon, C. E. The zero error capacity of a noisy channel. Institute of Radio Engineers, Transactions on Information Theory, IT-2, September (1956), 8–19.10.1109/TIT.1956.1056798Search in Google Scholar

[10] Vesel, A., and Žerovnik, J. Improved lower bound on the Shannon capacity of C₇. Inform. Process. Lett. 81, 5 (2002), 277–282.Search in Google Scholar