Graph entropy: Difference between revisions

Content deleted Content added
WikiSzepi (talk | contribs)
Fixing the definition, which was missing a crucial condition.
WikiSzepi (talk | contribs)
m Missing punctuation added
Line 6:
::<math>H(G) = \min_{X,Y} I(X ; Y)</math>
 
where <math>X</math> is chosen [[Discrete uniform distribution|uniformly]] from <math>V</math>, <math>Y</math> ranges over [[Independent set (graph theory)|independent sets]] of G, the joint distribution of <math>X</math> and <math>Y</math> is such that <math>X\in Y</math> with probability one, and <math>I(X ; Y)</math> is the [[mutual information]] of <math>X</math> and <math>Y</math> .<ref>G. Simonyi, "Perfect graphs and graph entropy. An updated survey," Perfect Graphs, John Wiley and Sons (2001) pp. 293-328, Definition 2”</ref>
 
==Properties==