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

On the number of independent subsets in trees with restricted degrees

โœ Scribed by Eric Ould Dadah Andriantiana; Stephan Wagner

Book ID
108200946
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
244 KB
Volume
53
Category
Article
ISSN
0895-7177

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

On the independent domination number of
On the independent domination number of graphs with given minimum degree
โœ N.I. Glebov; A.V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

The number of degree restricted maps on
The number of degree restricted maps on general surfaces
โœ Zhicheng Gao ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 727 KB

Let D be a finite set of positive integers with maximum bigger than two and ti,,.(rii,,.) be the number of n-edged rooted maps on the orientable (nonorientable) surface of type 9 whose face degrees (or, dually, vertex degrees) all lie in D. Define A&)= 1 ~g,&", ll>O cl,(x)= 1 fis,"X". ## Il>O We