The Shannon capacity of a graph and the independence numbers of its powers

Details The Shannon capacity of a graph and the independence numbers of its powers The Shannon capacity of a graph and the independence numbers of its powers

2006-08-03

arxiv.org/abs/cs/0608021v1

IEEE Trans. on Information Theory 52 (2006), 2172-2176

Computer Science

Information Theory

Scientific paper

The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that the series of independence numbers in strong powers of a fixed graph can exhibit a complex structure, implying that the Shannon Capacity of a graph cannot be approximated (up to a sub-polynomial factor of the number of vertices) by any arbitrarily large, yet fixed, prefix of the series. This is true even if this prefix shows a significant increase of the independence number at a given power, after which it stabilizes for a while.

Affiliated with

Also associated with

No associations

Rating

The Shannon capacity of a graph and the independence numbers of its powers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Shannon capacity of a graph and the independence numbers of its powers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Shannon capacity of a graph and the independence numbers of its powers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50309