Wedderburn–Etherington Number
Graph Theory, 2 (Number), Vertex (Graph Theory)
978-613-8-73934-0
6138739345
60
2012-01-21
29,00 €
eng
https://images.our-assets.com/cover/230x230/9786138739340.jpg
https://images.our-assets.com/fullcover/230x230/9786138739340.jpg
https://images.our-assets.com/cover/2000x/9786138739340.jpg
https://images.our-assets.com/fullcover/2000x/9786138739340.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, the Wedderburn–Etherington numbers, named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn, count how many weak binary trees can be constructed: that is, the number of trees for which each graph vertex (not counting the root) is adjacent to no more than three other such vertices, for a given number of nodes. The first few Wedderburn–Etherington numbers are:1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, 127912, 293547, 676157, 1563372, 3626149, 8436379, 19680277, 46026618, 107890609, 253450711, 596572387, 1406818759, 3323236238, 7862958391,...
https://morebooks.de/books/de/published_by/sess-press/192945/products
Mathematik
https://morebooks.de/store/de/book/wedderburn%E2%80%93etherington-number/isbn/978-613-8-73934-0