Content deleted Content added
Tried to add some clarification to the definition. The types of the variables may not have been obvious to a first time reader. |
Remove silly explanations of log_2. |
||
Line 17:
Additionally, simple formulas exist for certain families classes of graphs.
* Edge-less graphs have entropy <math>0</math>.
* [[Complete graph]]s on <math>n</math> vertices have entropy <math>\log_2 n</math>
* Complete balanced [[Multipartite graph|k-partite graphs]] have entropy <math>\
* Complete [[bipartite graphs]] with <math>n</math> vertices in one partition and <math>m</math> in the other have entropy <math>H\left(\frac{n}{m+n}\right)</math>, where <math>H</math> is the [[binary entropy function]].
| |||