Trees with 1-factors and oriented trees (Q1174177): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A graph polynomial and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distinct representatives of subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682013 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4081275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The parity of the number of 1-factors of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and matching theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5187307 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factors of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank | |||
Normal rank |
Latest revision as of 09:52, 15 May 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