References
- [1] B
achoc , C., Pêcher , A.,and Thiéry , A. On the theta number of powers of cycle graphs. Combinatorica 33, 3 (2013), 297–317. - [2] B
adalyan , S. H.,and Markosyan , S. E. On the independence number of the strong product of cycle-powers. Discrete Math. 313, 1 (2013), 105–110. - [3] B
aumert , L. D., Mc Eliece , 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. - [4] B
ohman , 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. - [5] C
odenotti , B., Gerace , I.,and Resta , G. Some remarks on the Shannon capacity of odd cycles. Ars Combin. 66 (2003), 243–257. - [6] H
ales , R. S. Numerical invariants and the strong product of graphs. J. Combinatorial Theory Ser. B 15 (1973), 146–155. - [7] K
örner , J.,and Orlitsky , A. Zero-error information theory. IEEE Trans. Inform. Theory 44, 6 (1998), 2207–2229. Information theory: 1948–1998. - [8] L
ovász , L. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25, 1 (1979), 1–7. - [9] S
hannon , 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] V
esel , A.,and Žerovnik , J. Improved lower bound on the Shannon capacity of C7. Inform. Process. Lett. 81, 5 (2002), 277–282.