When is graph entropy additive? Or

Perfect couples of graphs

Janos Korner, Gabor Simonyi, Z. Tuza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Summary form only given, as follows. Graph entropy is an information-theoretic functional on a graph and a probability distribution on its vertex set. Fixing the probability distribution, it is subadditive with respect to graph union. This property has been used by several authors to derive nonexistence bounds in graph covering problems. Here the authors deal with the conditions for additivity instead of subadditivity. For two complementary graphs it was proved by Csiszar et al. that additivity for every possible probability distribution is equivalent to the perfectness of the involved graph(s). Necessary and sufficient conditions of additivity (for every probability distribution) are given in full generality. This can be considered as a generalization of the concept of perfect graphs, giving some insight into the kind of graph properties to which graph entropy is sensitive.

Original languageEnglish
Title of host publication1990 IEEE Int Symp Inf Theor
PublisherPubl by IEEE
Pages171
Number of pages1
Publication statusPublished - 1990
Event1990 IEEE International Symposium on Information Theory - San Diego, CA, USA
Duration: Jan 14 1990Jan 19 1990

Other

Other1990 IEEE International Symposium on Information Theory
CitySan Diego, CA, USA
Period1/14/901/19/90

Fingerprint

Probability distributions
Entropy

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Korner, J., Simonyi, G., & Tuza, Z. (1990). When is graph entropy additive? Or: Perfect couples of graphs. In 1990 IEEE Int Symp Inf Theor (pp. 171). Publ by IEEE.

When is graph entropy additive? Or : Perfect couples of graphs. / Korner, Janos; Simonyi, Gabor; Tuza, Z.

1990 IEEE Int Symp Inf Theor. Publ by IEEE, 1990. p. 171.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Korner, J, Simonyi, G & Tuza, Z 1990, When is graph entropy additive? Or: Perfect couples of graphs. in 1990 IEEE Int Symp Inf Theor. Publ by IEEE, pp. 171, 1990 IEEE International Symposium on Information Theory, San Diego, CA, USA, 1/14/90.
Korner J, Simonyi G, Tuza Z. When is graph entropy additive? Or: Perfect couples of graphs. In 1990 IEEE Int Symp Inf Theor. Publ by IEEE. 1990. p. 171
Korner, Janos ; Simonyi, Gabor ; Tuza, Z. / When is graph entropy additive? Or : Perfect couples of graphs. 1990 IEEE Int Symp Inf Theor. Publ by IEEE, 1990. pp. 171
@inproceedings{e0d52c67e1cd44658eab2590464f21ec,
title = "When is graph entropy additive? Or: Perfect couples of graphs",
abstract = "Summary form only given, as follows. Graph entropy is an information-theoretic functional on a graph and a probability distribution on its vertex set. Fixing the probability distribution, it is subadditive with respect to graph union. This property has been used by several authors to derive nonexistence bounds in graph covering problems. Here the authors deal with the conditions for additivity instead of subadditivity. For two complementary graphs it was proved by Csiszar et al. that additivity for every possible probability distribution is equivalent to the perfectness of the involved graph(s). Necessary and sufficient conditions of additivity (for every probability distribution) are given in full generality. This can be considered as a generalization of the concept of perfect graphs, giving some insight into the kind of graph properties to which graph entropy is sensitive.",
author = "Janos Korner and Gabor Simonyi and Z. Tuza",
year = "1990",
language = "English",
pages = "171",
booktitle = "1990 IEEE Int Symp Inf Theor",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - When is graph entropy additive? Or

T2 - Perfect couples of graphs

AU - Korner, Janos

AU - Simonyi, Gabor

AU - Tuza, Z.

PY - 1990

Y1 - 1990

N2 - Summary form only given, as follows. Graph entropy is an information-theoretic functional on a graph and a probability distribution on its vertex set. Fixing the probability distribution, it is subadditive with respect to graph union. This property has been used by several authors to derive nonexistence bounds in graph covering problems. Here the authors deal with the conditions for additivity instead of subadditivity. For two complementary graphs it was proved by Csiszar et al. that additivity for every possible probability distribution is equivalent to the perfectness of the involved graph(s). Necessary and sufficient conditions of additivity (for every probability distribution) are given in full generality. This can be considered as a generalization of the concept of perfect graphs, giving some insight into the kind of graph properties to which graph entropy is sensitive.

AB - Summary form only given, as follows. Graph entropy is an information-theoretic functional on a graph and a probability distribution on its vertex set. Fixing the probability distribution, it is subadditive with respect to graph union. This property has been used by several authors to derive nonexistence bounds in graph covering problems. Here the authors deal with the conditions for additivity instead of subadditivity. For two complementary graphs it was proved by Csiszar et al. that additivity for every possible probability distribution is equivalent to the perfectness of the involved graph(s). Necessary and sufficient conditions of additivity (for every probability distribution) are given in full generality. This can be considered as a generalization of the concept of perfect graphs, giving some insight into the kind of graph properties to which graph entropy is sensitive.

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

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

M3 - Conference contribution

SP - 171

BT - 1990 IEEE Int Symp Inf Theor

PB - Publ by IEEE

ER -