On the Shannon Capacity of a Graph

Research output: Contribution to journalArticle

763 Citations (Scopus)

Abstract

It is proved that the Shannon zero-error capacity of the pentagon is v'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 Yn.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalIEEE Transactions on Information Theory
Volume25
Issue number1
DOIs
Publication statusPublished - 1979

Fingerprint

Group

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Library and Information Sciences
  • Electrical and Electronic Engineering

Cite this

On the Shannon Capacity of a Graph. / Lovász, L.

In: IEEE Transactions on Information Theory, Vol. 25, No. 1, 1979, p. 1-7.

Research output: Contribution to journalArticle

@article{a308992ced094d6ea34fe9486b9b5446,
title = "On the Shannon Capacity of a Graph",
abstract = "It is proved that the Shannon zero-error capacity of the pentagon is v'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 Yn.",
author = "L. Lov{\'a}sz",
year = "1979",
doi = "10.1109/TIT.1979.1055985",
language = "English",
volume = "25",
pages = "1--7",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - On the Shannon Capacity of a Graph

AU - Lovász, L.

PY - 1979

Y1 - 1979

N2 - It is proved that the Shannon zero-error capacity of the pentagon is v'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 Yn.

AB - It is proved that the Shannon zero-error capacity of the pentagon is v'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 Yn.

UR - http://www.scopus.com/inward/record.url?scp=0018292109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018292109&partnerID=8YFLogxK

U2 - 10.1109/TIT.1979.1055985

DO - 10.1109/TIT.1979.1055985

M3 - Article

VL - 25

SP - 1

EP - 7

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -