On graphs in which the Shannon capacity is unachievable by finite product
暂无分享，去创建一个
Given a graph G, there is a maximum number alpha (G) of vertices that are mutually nonadjacent. A class of graphs, including the sum of an odd cycle C/sub 2n+3/(n>or=1) and a universal graph for which the Shannon capacity is not achieved by any finite power is described. >
[1] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[2] R. S. Hales,et al. Numerical invariants and the strong product of graphs , 1973 .
[3] Fred S. Roberts,et al. Analogues of the Shannon Capacity of a Graph , 1982 .
[4] M. Rosenfeld. ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY , 1967 .
[5] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.