Trees with 1-factors and oriented trees (Q1174177): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:21, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trees with 1-factors and oriented trees |
scientific article |
Statements
Trees with 1-factors and oriented trees (English)
0 references
25 June 1992
0 references
Trees with 1-factors (or simply matched trees) are those with a complete matching of the vertices. Using the technique of the generating functions, some recursive and asymptotic formulae concerning the number of rooted, planted and unlabeled matched trees are presented. Further, a unique correspondence between the matched trees on \(2n\) vertices and oriented trees on \(n\) vertices is shown which makes possible to prove some results concerning the number of self-converse oriented trees.
0 references
matched trees
0 references
generating functions
0 references
oriented trees
0 references