|
Fundamentalnaya i Prikladnaya Matematika, 2007, Volume 13, Issue 6, Pages 9–17
(Mi fpm1082)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On planes trees with a prescribed number of valency set realizations
N. M. Adrianov M. V. Lomonosov Moscow State University
Abstract:
We describe valency sets of plane bicolored trees with a prescribed number of realizations by plane trees. Three special types of plane trees are defined: chains, trees of diameter 4, and special trees of diameter 6. We prove that there is a finite number of valency sets that have $R$ realizations as plane trees and do not belong
to these special types. The number of edges of such trees is less than or equal to $12R+2$. The complete lists of valency sets of plane bicolored trees with 1, 2, or 3 realizations are presented.
Citation:
N. M. Adrianov, “On planes trees with a prescribed number of valency set realizations”, Fundam. Prikl. Mat., 13:6 (2007), 9–17; J. Math. Sci., 158:1 (2009), 5–10
Linking options:
https://www.mathnet.ru/eng/fpm1082 https://www.mathnet.ru/eng/fpm/v13/i6/p9
|
Statistics & downloads: |
Abstract page: | 312 | Full-text PDF : | 115 | References: | 66 | First page: | 1 |
|