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

Surpassing the information theoretic bound with fusion trees

โœ Scribed by Michael L. Fredman; Dan E. Willard

Book ID
103159311
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
910 KB
Volume
47
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximizing the number of independent sub
Maximizing the number of independent subsets over trees with bounded degree
โœ Clemens Heuberger; Stephan G Wagner ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 208 KB ๐Ÿ‘ 1 views

## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has

A lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
โœ Katherine Heinrich; Guizhen Liu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 286 KB ๐Ÿ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span