Combinatorial and Discrete Geometry: Sheet L
Department of Mathematics and Computer Studies
York College (CUNY)
Jamaica, New York 11451
web page: http://www.york.cuny.edu/~malk
A tree is a connected graph without cycles.
If ti denotes the number of vertices of a tree with valence i, verify that the following equation holds for the valences of the vertices of a tree, where n denotes the vertex of max valence in the tree: