On estimates of degrees of linear independence for some numbers
โ Scribed by P. L. Ivankov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1994
- Tongue
- English
- Weight
- 298 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Convergence acceleration processes are known to be well conditioned for alternating sequences and ill conditioned for monotonic ones. The aim of this paper is to adapt the definition of conditioning and to give a link between this notion and the property of convergence acceleration. The cases of the