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.<
>