Summary form only given. Graph entropy H(G, P) is an information-theoretic functional on a graph G with a probability distribution P on its vertices and is subadditive in a certain sense. Korner and Marton proved that bipartite graphs are strongly splitting while odd cycles are not. They conjectured that all perfect graphs are strongly splitting. The authors have proved this conjecture.
|Number of pages||2|
|Publication status||Published - Dec 1 1988|
ASJC Scopus subject areas