### 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 language | English |
---|---|

Number of pages | 1 |

Publication status | Published - Dec 1 1990 |

Event | 1990 IEEE International Symposium on Information Theory - San Diego, CA, USA Duration: Jan 14 1990 → Jan 19 1990 |

### Other

Other | 1990 IEEE International Symposium on Information Theory |
---|---|

City | San Diego, CA, USA |

Period | 1/14/90 → 1/19/90 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'When is graph entropy additive? Or: Perfect couples of graphs'. Together they form a unique fingerprint.

## Cite this

*When is graph entropy additive? Or: Perfect couples of graphs*. Paper presented at 1990 IEEE International Symposium on Information Theory, San Diego, CA, USA, .