A dominating set D of a graph G is a least dominating set (I.d.s) if y((D)) < 2~((D~)) for any dominating set D1 (7 denotes domination number). The least domination number ~ ~ (G) of G is the minimum cardinality of a 1.d.s. We prove a conjecture of Sampathkumar (1990) that Vl ~< 3p/5 for any connect
โฆ LIBER โฆ
A Proof of the Stokes Conjecture in the Theory of Surface Waves
โ Scribed by P. I. Plotnikov
- Book ID
- 108542746
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 219 KB
- Volume
- 108
- Category
- Article
- ISSN
- 0022-2526
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Proof of a conjecture in domination theo
โ
Igor E. Zverovich
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 76 KB
The Proof of a Conjecture of Additive Nu
โ
Alexandru Gica
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 94 KB
The aim of this paper is to show that for any n ยฅ N, n > 3, there exist a, b ยฅ N\* such that n=a+b, the ''lengths'' of a and b having the same parity (see the text for the definition of the ''length'' of a natural number). Also we will show that for any n ยฅ N, n > 2, n ] 5, 10, there exist a, b ยฅ N\
On the stokes conjecture for the wave of
โ
C. J. Amick; L. E. Fraenkel; J. F. Toland
๐
Article
๐
1982
๐
Springer Netherlands
๐
English
โ 765 KB
A proof of the Bieberbach conjecture
โ
Louis De Branges
๐
Article
๐
1985
๐
Springer Netherlands
๐
English
โ 599 KB
A proof of the Mullineux conjecture
โ
Ben Ford; Alexander S. Kleshchev
๐
Article
๐
1997
๐
Springer-Verlag
๐
French
โ 418 KB
Proof of a Conjecture by Dyson in the St
โ
Gunson, J.
๐
Article
๐
1962
๐
American Institute of Physics
๐
English
โ 273 KB