In this paper we examine the enumeration of alternating trees. We give a bijective proof of the fact that the number of alternating unrooted trees with n vertices is given by (1รn2 n&1 ) n k=1 ( n k ) k n&1 , a problem first posed by A. Postnikov (1997, J. Combin. Theory Ser. A 79, 360 366). We also
โฆ LIBER โฆ
Enumeration of alternating sequences
โ Scribed by J.C. Parnami; K.C. Prasad
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 143 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Enumerating Alternating Trees
โ
Cedric Chauve; Serge Dulucq; Andrew Rechnitzer
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 164 KB
Enumeration of certain types of sequence
โ
L. Carlitz
๐
Article
๐
1971
๐
John Wiley and Sons
๐
English
โ 565 KB
Enumeration of sequences of nonnegative
โ
M. J. Hodel
๐
Article
๐
1974
๐
John Wiley and Sons
๐
English
โ 501 KB
The enumeration of generalised alternati
โ
I.P. Goulden; D.M. Jackson
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 595 KB
We &XV that a number of problems involving the en jmeration of alternating subsets of integers may be solved by a direct method as special cases of the enumeration of configurations which w have termed (2, q)-sequences. In this paper we consider a class of enumeration problems which have received a
Enumeration of graphs by degree sequence
โ
Phil Hanlon
๐
Article
๐
1979
๐
John Wiley and Sons
๐
English
โ 173 KB
Enumeration of subspaces by dimension se
โ
Edward A Bender; Raymond Coley; David P Robbins; Howard Rumsey Jr.
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 469 KB