Enumerating alternating trees (Q5937130): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2082196278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5616724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intransitive trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4324964 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:12, 3 June 2024
scientific article; zbMATH DE number 1618555
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumerating alternating trees |
scientific article; zbMATH DE number 1618555 |
Statements
Enumerating alternating trees (English)
0 references
29 October 2001
0 references
A tree \(T_n\) with \(n\) labelled nodes is said to be an alternating tree if the labels of the nodes on every path form an alternating sequence. \textit{A. Postnikov} [J. Comb. Theory, Ser. A 79, No. 2, 360-366 (1997; Zbl 0876.05042)] used generating functions and Lagrange's inversion formula to derive an expression for the number of unrooted alternating trees \(T_n\). The present authors give a bijective proof of his result. They also show that there are \(2(n-1)^{n-1}\) and \((n-1)^{n-2}\) rooted and unrooted alternating ordered trees \(T_n\).
0 references
enumeration
0 references
intransitive trees
0 references
alternating tree
0 references