๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The number of maximum matchings in a tree

โœ Scribed by Clemens Heuberger; Stephan Wagner

Book ID
113567397
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
700 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The structure and maximum number of maxi
The structure and maximum number of maximum independent sets in trees
โœ Jennifer Zito ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

The number of perfect matchings in a hyp
The number of perfect matchings in a hypercube
โœ Niall Graham; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff