|
Fundamentalnaya i Prikladnaya Matematika, 2013, Volume 18, Issue 6, Pages 171–184
(Mi fpm1560)
|
|
|
|
Enumeration of one class of plane weighted trees
Yu. Yu. Kochetkov National Research University "Higher School of Economics", Moscow, Russia
Abstract:
We present an enumeration formula for weighted trees, i.e., trees where vertices and edges have weights (a weight is a positive integer) and the weight of each vertex is equal to the sum of the weights of the edges incident to it. Each tree has a binary structure: we can color its vertices in two colors, black and white, so that adjacent vertices have different colors. In this work, the following problem is considered: enumerate weighted plane trees with given sets of weights of black and white vertices.
Citation:
Yu. Yu. Kochetkov, “Enumeration of one class of plane weighted trees”, Fundam. Prikl. Mat., 18:6 (2013), 171–184; J. Math. Sci., 209:2 (2015), 282–291
Linking options:
https://www.mathnet.ru/eng/fpm1560 https://www.mathnet.ru/eng/fpm/v18/i6/p171
|
Statistics & downloads: |
Abstract page: | 210 | Full-text PDF : | 102 | References: | 23 |
|