DocumentCode :
929524
Title :
On the Shannon capacity of a graph
Author :
Lovász, László
Volume :
25
Issue :
1
fYear :
1979
fDate :
1/1/1979 12:00:00 AM
Firstpage :
1
Lastpage :
7
Abstract :
It is proved that the Shannon zero-error capacity of the pentagon is \\sqrt {5} . The method is then generalized to obtain upper bounds on the capacity of an arbitrary graph. A well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases. Several results are obtained on the capacity of special graphs; for example, the Petersen graph has capacity four and a self-complementary graph with n points and with a vertex-transitive automorphism group has capacity \\sqrt {5} .
Keywords :
Graph theory; Information rates; Combinatorial mathematics; Linear programming; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1979.1055985
Filename :
1055985
Link To Document :
بازگشت