Theil index

2014-01-28T16:38:11Z

192.86.100.203: /* Formulas */

In [[graph theory]], for a connected graph <math>G</math>, a [[spanning tree (mathematics)|spanning tree]] <math>T</math> is a subgraph of <math>G</math> with the least number of edges that still spans <math>G</math>. A number of properties can be proved about <math>T</math>. <math>T</math> is acyclic, has (<math>|V|-1</math>) edges where <math>V</math> is the number of vertices in <math>G</math> etc.

A '''minimum degree spanning tree''' <math>T'</math> is a spanning tree which has the least maximum degree. The vertex of maximum degree in <math>T'</math> is the least among all possible spanning trees of <math>G</math>.

See [[Degree-constrained_spanning_tree| Degree-Constrained Spanning Tree]].

{{Unreferenced|date=April 2009}}

[[Category:Spanning tree]]

formulasearchengine - User contributions [en]

Theil index