The number of k node subtrees of a tree is its kth Whitney number. This paper establishes quadratic bounds in the number of nodes on the alternating sum of the Whitney numbers weighted by k\*. The lower bound is achieved precisely for paths on an even number of nodes. The upper bound is achieved for
Alternating Whitney sums and matchings in trees, part 1
β Scribed by Robert E Jamison
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 673 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The number of k-node subtrees of a tree is its kth Whitney number. This paper investigates the behavior of certain alternating sums of these Whitney numbers and shows how they are related to the structure of maximum matchings in the tree. It is shown that the alternating sum of the Whitney numbers gives the maximum cardinality of an independent set of nodes. Moreover, a weighted alternating sum yields the number of nodes left uncovered by at least one maximum matching.
π SIMILAR VOLUMES
## Algorithmic aspects of alternating sum of volumes. Part 1: Data structure and difference operation
## Abstract ^13^C magnetic resonance spectra of several enamino ketones with secondary and tertiary amino groups were obtained for trifluoroacetic acid solutions. In both series __O__βprotonation is predominant and the chemical shifts are related to the electron density changes with respect to the