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

On the number of independent sets in the trees of a fixed diameter

โœ Scribed by A. B. Dainyak

Book ID
111471274
Publisher
Pleiades Publishing
Year
2010
Tongue
English
Weight
553 KB
Volume
4
Category
Article
ISSN
1990-4789

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

On the spectral radius of weighted trees
On the spectral radius of weighted trees with fixed diameter and weight set
โœ Shang-wang Tan; Yan-hong Yao ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits. We first give some perturbational results on the spectral radius of weighted graphs when some weights of edges are modified, then we derive the weighted tree with the largest spect