Encyclopedia > W > Wedderburn-Etherington number
Wedderburn-Etherington number
In graph theory, the Wedderburn-Etherington numbers count how many weakly binary trees can be constructed such that each graph vertex (not counting the root vertex) is adjacent to no more than three other such vertices, for a given number of nodes. The first few Wedderburn-Etherington numbers are
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)