Let T be a weighted rooted tree of k levels such that (1) the vertices in level j have a degree equal to d k-j +1 for j = 1, 2, . . . , k, and (2) the edges joining the vertices in level j with the vertices in level (j + 1) have a weight equal to w k-j for j = 1, 2, . . . , k -1. We give a complete
β¦ LIBER β¦
On the spectra of certain rooted trees
β Scribed by Oscar Rojo
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 234 KB
- Volume
- 414
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the spectra of some weighted rooted t
β
Oscar Rojo; MarΓa Robbiano
π
Article
π
2007
π
Elsevier Science
π
English
β 221 KB
On the spectra of some graphs like weigh
β
RosΓ‘rio Fernandes; Helena Gomes; Enide Andrade Martins
π
Article
π
2008
π
Elsevier Science
π
English
β 213 KB
On the Complexity of Inferring Rooted Ev
β
Jesper Jansson
π
Article
π
2001
π
Elsevier Science
π
English
β 274 KB
On the Total Heights of Random Rooted Bi
β
L. Takacs
π
Article
π
1994
π
Elsevier Science
π
English
β 306 KB
Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the
Spectra of weighted generalized Bethe tr
β
Oscar Rojo
π
Article
π
2008
π
Elsevier Science
π
English
β 184 KB
Finite dimensional comodules over the Ho
β
L. Foissy
π
Article
π
2002
π
Elsevier Science
π
English
β 257 KB