Let D be a strongly k-connected digraph of order n/> 2. We prove that for every l >i n/2k the power D t of D is Hamiltonian. Moreover, for any k >/1 and n > 2k we exhibit a strongly k-connected digraph D of order n such that D rn/2kl-1 is non-Hamiltonian. We use standard terminology, unless otherwi
β¦ LIBER β¦
An upper bound on indices of finite fuzzy relations
β Scribed by Li Jian-Xin
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 250 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An upper bound for the Hamiltonicity exp
β
GΓΌnter Schaar; A. Pawel Wojda
π
Article
π
1997
π
Elsevier Science
π
English
β 136 KB
On the fuzziness of solutions of -fuzzy
β
Antonio Di Nola; Salvatore Sessa
π
Article
π
1983
π
Elsevier Science
π
English
β 620 KB
An Upper Bound for the Length of a Finit
β
Christopher J Pappacena
π
Article
π
1997
π
Elsevier Science
π
English
β 180 KB
Let F be a field, and let A be a finite-dimensional F-algebra. Write d s dim A, F and let e be the largest degree of the minimal polynomial for any a g A. Define Ε½ . ' the function f d, e s e 2dr e y 1 q 1r4 q er2 y 2. We prove that, if S is Ε½ . any finite generating set for A as an F-algebra, the
On an application of fuzzy relations in
β
Andreja TepavΔeviΔ; Ante VujiΔ
π
Article
π
1996
π
Elsevier Science
π
English
β 552 KB
An upper bound on the number of linear r
β
Keith G. Woodgate
π
Article
π
1995
π
Elsevier Science
π
English
β 296 KB
AN UPPER BOUND ON DISPLACEMENTS OF DAMPE
β
S.M. Shahruz; P.A. Mahavamana
π
Article
π
1998
π
Elsevier Science
π
English
β 199 KB